Efficient algorithms for acyclic colorings of graphs

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

Information Processing Letters

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing

Exact algorithms for coloring graphs while avoiding monochromatic cycles

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management

Heuristics for Deciding Collectively Rational Consumption Behavior

Computational Economics

The tree constraint

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles

INFORMS Journal on Computing