On the NP-completeness of the k-colorability problem for triangle-free graphs
Discrete Mathematics
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Vertex Colouring and Forbidden Subgraphs – A Survey
Graphs and Combinatorics
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree
SIAM Journal on Discrete Mathematics
Clique-Width for 4-Vertex Forbidden Subgraphs
Theory of Computing Systems
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
Theoretical Computer Science
List coloring in the absence of a linear forest
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Journal of Discrete Algorithms
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
A Characterization of b-Perfect Graphs
Journal of Graph Theory
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
| Hi-index | 5.23 |
A colouring of a graph G=(V,E) is a mapping c:V-{1,2,...} such that c(u)c(v) if uv@?E; if |c(V)|=