No CrossRef data available.
Chromatic-durable graphs†
Published online by Cambridge University Press: 24 October 2008
Extract
One of the most studied parameters in all of graph theory is the chromatic number. Undoubtedly, its popularity as a subject for research is due to its intimate relationship with the famous Four Colour Problem.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 71 , Issue 2 , March 1972 , pp. 227 - 233
- Copyright
- Copyright © Cambridge Philosophical Society 1972
References
REFERENCES
(1)Chartrand, G., Geller, D. and Hedetniemi, S.Graphs with forbidden subgraphs. J. Combinatorial Theory 10 (1971), 12–41.CrossRefGoogle Scholar
(2)Chartrand, G. and Harary, F.Planar permutation graphs. Ann. Inst. H. Poincaré (Sect. B), 3 (1967), 433–438.Google Scholar
(3)Chartrand, G. and Kronk, H.The point-arboricity of planar graphs. J. London Math. Soc. 44 (1969), 612–616.CrossRefGoogle Scholar
(4)Chartrand, G., Kronk, H. and Wall, C.The point-arboricity of a graph. Israel J. Math. 6 (1968), 169–175.CrossRefGoogle Scholar
(5)Dirac, G.A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952), 85–92.CrossRefGoogle Scholar
(6)Dirac, G.Some theorems on abstract graphs. Proc. London Math. Soc. Sec. 3, 2 (1952), 69–81.CrossRefGoogle Scholar
(7)Hedetniemi, S.On partitioning planar graphs. Canad. Math. Bull. 11 (1968), 203–211.CrossRefGoogle Scholar
(8)Kuratowski, C.Sur le probleme des courbes gauches en topologies. Fund. Math. 15 (1930), 271–283.CrossRefGoogle Scholar