On color-critical ($P_{5},\overline{P}_5$)-free graphs (original) (raw)
Related papers
Deciding k-colourability of P_5-free graphs in polynomial time
arXiv (Cornell University), 2007
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Algorithmica, 2010
A Refinement on the Structure of Vertex-Critical (P5, Gem)-Free Graphs
Social Science Research Network, 2022
k-Colorability of P5-free graphs
Arxiv preprint cs/0609083, 2006
Constructions ofk-criticalP5-free graphs
Discrete Applied Mathematics, 2015
Electronic Notes in Discrete Mathematics, 2013
The chromatic number of{P5,K4}-free graphs
Discrete Mathematics, 2013
4-colorability of P6-free graphs
Electronic Notes in Discrete Mathematics, 2015
Dichotomizing k-vertex-critical H-free graphs for H of order four
Discrete Applied Mathematics, 2022
5-coloring K 3, k -minor-free graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
arXiv (Cornell University), 2014
Discrete Applied Mathematics, 2015
3-Colorability ∈P for P6-free graphs
Discrete Applied Mathematics, 2004
2006
Complexity of Coloring Graphs without Paths and Cycles
Lecture Notes in Computer Science, 2014
A complexity dichotomy for critical values of the b-chromatic number of graphs
Theoretical Computer Science
Graph coloring satisfying restraints
Discrete Mathematics, 1990
New results on generalized graph coloring
2004
The edge colorings of K5-minor free graphs
Discrete Mathematics, 2021
Remarks on proper conflict-free colorings of graphs
Discrete Mathematics
Crispin Zavala, Juan Frausto Solis
2010
The Complexity of some Problems Related to Graph 3-colorability
Discrete Applied Mathematics, 1998
Classifying k-Edge Colouring for H-free Graphs
Information Processing Letters
On-line 3-chromatic graphs - II critical graphs
Discrete Mathematics, 1997
Discrete Mathematics, 2002
On the Computational Complexity of the Forcing Chromatic Number
SIAM Journal on Computing, 2007
On the complexity of the selective graph coloring problem in some special classes of graphs
Theoretical Computer Science, 2013
Selective graph coloring in some special classes of graphs
The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph
Australas. J Comb., 2011
Adjacent vertex-distinguishing edge colorings of K4-minor free graphs
Applied Mathematics Letters, 2011
On critical graphs with chromatic index 4
Discrete Mathematics, 1974
On minimal triangle-free graphs with prescribed k-defective chromatic number
Discrete Mathematics, 2011
Conflict-Free Coloring of Graphs
SIAM Journal on Discrete Mathematics