Hostname: page-component-848d4c4894-jbqgn Total loading time: 0 Render date: 2024-06-19T20:24:31.046Z Has data issue: false hasContentIssue false

Chromatic-durable graphs

Published online by Cambridge University Press:  24 October 2008

Don R. Lick
Affiliation:
Western Michigan University
Arthur T. White
Affiliation:
Western Michigan University

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
Copyright
Copyright © Cambridge Philosophical Society 1972

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Chartrand, G., Geller, D. and Hedetniemi, S.Graphs with forbidden subgraphs. J. Combinatorial Theory 10 (1971), 1241.CrossRefGoogle Scholar
(2)Chartrand, G. and Harary, F.Planar permutation graphs. Ann. Inst. H. Poincaré (Sect. B), 3 (1967), 433438.Google Scholar
(3)Chartrand, G. and Kronk, H.The point-arboricity of planar graphs. J. London Math. Soc. 44 (1969), 612616.CrossRefGoogle Scholar
(4)Chartrand, G., Kronk, H. and Wall, C.The point-arboricity of a graph. Israel J. Math. 6 (1968), 169175.CrossRefGoogle Scholar
(5)Dirac, G.A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952), 8592.CrossRefGoogle Scholar
(6)Dirac, G.Some theorems on abstract graphs. Proc. London Math. Soc. Sec. 3, 2 (1952), 6981.CrossRefGoogle Scholar
(7)Hedetniemi, S.On partitioning planar graphs. Canad. Math. Bull. 11 (1968), 203211.CrossRefGoogle Scholar
(8)Kuratowski, C.Sur le probleme des courbes gauches en topologies. Fund. Math. 15 (1930), 271283.CrossRefGoogle Scholar