Skip to main content
SpringerLink
Log in

On colour critical graphs

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Included in the following conference series:

  • 207 Accesses

Abstract

A brief survey of the theory of colour critical graphs, with an emphasis on constructive methods, is given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brooks, R.L., On colouring the nodes of a network. Proc. Cambridge Phil. Soc. 37 (1941), 194–197.

    Google Scholar 

  2. Brown, W.G. and J.W. Moon, Sur les ensembles de sommets indépendants dans les graphes chromatiques minimaux. Can. J. Math. 21 (1969), 274–278.

    Google Scholar 

  3. Dirac, G.A., Some theorems on abstract graphs. Proc. London Math. Soc. (3) 2 (1952), 69–81.

    Google Scholar 

  4. Dirac, G.A., A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952), 85–92.

    Google Scholar 

  5. Dirac, G.A., The structure of k-chromatic graphs. Fund. Math. 40 (1953), 42–55.

    Google Scholar 

  6. Dirac, G.A., Theorems related to the four colour conjecture. J. London Math. Soc. 29 (1954), 143–149.

    Google Scholar 

  7. Dirac, G.A., Circuits in critical graphs. Monatshefte für Math. 59 (1955), 178–187.

    Google Scholar 

  8. Dirac, G.A., Map colour theorems related to the Heawood colour formula. J. London Math. Soc. 31 (1956), 460–471.

    Google Scholar 

  9. Dirac, G.A., Map colour theorems related to the Heawood colour formula (II). J. London Math. Soc. 32 (1957), 436–455.

    Google Scholar 

  10. Dirac, G.A., A theorem of R.L. Brooks and a conjecture of H. Hadwiger. Proc. London Math. Soc. (3) 7 (1957), 161–195.

    Google Scholar 

  11. Dirac, G.A., On the structure of 5-and 6-chromatic abstract graphs. J. reine u. angew. Math. 214/215 (1964), 43–52.

    Google Scholar 

  12. Erdös, P., On circuits and subgraphs of chromatic graphs. Mathematika 9 (1962), 170–175.

    Google Scholar 

  13. Gallai, T., Kritische Graphen I. Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 (1963), 165–192.

    Google Scholar 

  14. Gallai, T., Kritische Graphen II. Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 (1963), 373–395.

    Google Scholar 

  15. Greenwell, D. and L. Lovász, Applications of product colouring. Acta Math. Acad. Sci. Hungar. 25 (1974), 335–340.

    Google Scholar 

  16. Hajós, G., Über eine Konstruktion nicht n-färbbarer Graphen. Wiss. Zeitschrift Martin-Luther-Univ. Halle-Wittenberg, Math.-Nat. X/1 (1961), 113–114. (See also: Ringel, G., Färbungs-probleme auf Flächen und Graphen, Berlin, 1959; pp. 27–30.)

    Google Scholar 

  17. Kelly, J.B. and L.M. Kelly, Paths and circuits in critical graphs. Amer. J. Math. 76 (1954), 786–792.

    Google Scholar 

  18. Lovász, L., Independent sets in critical chromatic graphs. Studia Sci. Math. Hungar. 8 (1973), 165–168.

    Google Scholar 

  19. Lovász, L., Combinatorial Problems and Exercises (Akad. Kiadó, Budapest 1979), Problems 9.16–24 (pp. 60/61).

    Google Scholar 

  20. Müller, V., On colorable critical and uniquely colorable critical graphs. In: Recent Advances in Graph Theory (Proc. 2nd Czechoslovak. Sympos., Prague, 1974), pp. 385–386.

    Google Scholar 

  21. Read, R.C., Maximal circuits in critical graphs. J. London Math. Soc. 32 (1957), 456–462.

    Google Scholar 

  22. Sachs, H. and M. Stiebitz, Construction of colour-critical graphs with given major-vertex subgraph. Annals of Discrete Mathematics 17 (1983), 581–598.

    Google Scholar 

  23. Simonovits, M., On colour-critical graphs. Studia Sci. Math. Hungar. 7 (1972), 67–81.

    Google Scholar 

  24. Stiebitz, M., Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs. Combinatorica 2 (1982), 315–323.

    Google Scholar 

  25. Stiebitz, M., Colour-critical graphs with complete major-vertex subgraph. In: Graph Theory and Applications (Proc. Int. Conf. on Graph Theory and Applications, Eyba, 1.–5. 10. 84), BSB B.G. Teubner Verlagsges. Leipzig (to appear).

    Google Scholar 

  26. Stiebitz, M., Subgraphs of colour-critical graphs. Submitted to Combinatorica.

    Google Scholar 

  27. Toft, B., On the maximal number of edges of critical k-chromatic graphs. Studia Sci. Math. Hungar. 5 (1970), 461–470.

    Google Scholar 

  28. Toft, B., Some contributions to the theory of colour-critical graphs. Doct. Diss., Univ. of London, 1971; Var. Publ. Ser. 14.

    Google Scholar 

  29. Toft, B., Two theorems on critical 4-chromatic graphs. Studia Sci. Math. Hungar. 7 (1972), 83–89.

    Google Scholar 

  30. Toft, B., Color-critical graphs and hypergraphs. J. Comb. Theory (B) 16 (1974), 145–161.

    Google Scholar 

  31. Toft, B., On critical subgraphs of colour-critical graphs. Discrete Math. 7 (1974), 377–392.

    Google Scholar 

  32. Toft, B., Problem posed at the 6th Hungarian Colloquium on Combinatorics in Eger, Hungary, July 1981.

    Google Scholar 

  33. Toft, B., Some problems and results related to subgraphs of colour critical graphs. In: Graphen in Forschung und Unterricht (ed. R. Bodendiek et al.), B. Franzbecker Verlag, Salzdetfurth 1985; pp. 178–186.

    Google Scholar 

  34. Voss, H.-J., Graphs with prescribed maximal subgraphs and critical chromatic graphs. Comment. Math. Univ. Carolinae 18 (1977), 129–142.

    Google Scholar 

  35. Wessel, W., Eigenschaften, Operationen, Kritizität von Graphen. Dissertationsschrift (B), Techn. Hochschule Ilmenau 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Hochschule Ilmenau, PSF 327, DDR - 6300, Ilmenau

    Horst Sachs

Authors
  1. Horst Sachs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sachs, H. (1985). On colour critical graphs. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028823

Download citation

  • DOI: https://doi.org/10.1007/BFb0028823

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation