Graph Theory, Graduate Texts in Mathematics, vol.244, 2008. ,
DOI : 10.1007/978-1-84628-970-5
Problem 2, Theory of Graphs (Proc. Colloq., Tihany, p.361, 1966. ,
On chromatic number of graphs and set-systems, Acta Mathematica Academiae Scientiarum Hungaricae, vol.24, issue.66, pp.61-99, 1966. ,
DOI : 10.1007/BF02020444
Graph Coloring Problems Wiley-Interscience Series in Discrete Mathematics and Optimization, 1995. ,
Double-critical graphs and complete minors, Electron. J. Combin, vol.17, issue.87, 2010. ,
k-degenerate graphs. Canad, J. Math, vol.22, pp.1082-1096, 1970. ,
Smallest-last ordering and clustering and graph coloring algorithms, Journal of the ACM, vol.30, issue.3, pp.417-427, 1983. ,
DOI : 10.1145/2402.322385
geng -a program for generating graphs, 2008. ,
Twice critical graphs with chromatic number five, Metody Diskret. Analiz, issue.46, pp.50-59, 1987. ,
Contributions to the Theory of Colourings, Graph Minors, and Independent Sets, 2010. ,
The Sage Development Team, Sage Mathematics Software, 2012. ,
K5 is the only double-critical 5-chromatic graph, Discrete Mathematics, vol.64, issue.1, pp.91-93, 1987. ,
DOI : 10.1016/0012-365X(87)90242-1
On k-critical n-chromatic graphs, Combinatorics (Eger, pp.509-514, 1987. ,
Decomposing graphs under degree constraints, Journal of Graph Theory, vol.23, issue.3, pp.321-324, 1996. ,
DOI : 10.1002/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H
Colouring, stable sets and perfect graphs, Handbook of Combinatorics, pp.233-288, 1995. ,