Two cases of polynomial-time solvability for the coloring problem

Problems from the world surrounding perfect graphs

András Gyárfás · Applicationes Mathematicae · 1987 · 372 citations · Full text

Natural Sciences, Computer Science, Mathematics +10

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

Chı́nh T. Hoàng, Marcin Kamiński, Vadim Lozin et al. · Algorithmica · 2008 · 166 citations

Computing, Computer Science, Algorithms +12

On the NP-completeness of the k-colorability problem for triangle-free graphs

Frédéric Maffray, Myriam Preissmann · Discrete Mathematics · 1996 · 134 citations

Computing, Computer Science, Mathematics +11

Vertex coloring of graphs with few obstructions

Vadim Lozin, D. S. Malyshev · Discrete Applied Mathematics · 2015 · 51 citations

Natural Sciences, Visualization, Combinatorics +10

Characterizations and recognition of circular-arc graphs and subclasses: A survey

Min Chih Lin, Jayme L. Szwarcfiter · Discrete Mathematics · 2008 · 50 citations · Full text

Computing, Computer Science, Mathematics +12