Skip to main content
SpringerLink
Log in

The chromatic class of a multigraph

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. C. Berge, The Theory of Graphs and Its Application [Russian translation], IL, 1962.

  2. C. E. Shannon, “A theorem on the coloring of the rays of a graph,” Cybernetics Collection [Russian translation], I, IL, 249–253, 1960, (see also C. Shannon, Studies in Information Theory and Cybernetics [Russian translation], IL, 735 739, 1963.

  3. D. König, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936.

  4. C. Berge, “Les problèmes de coloration en théorie des graphes,” Publs. Inst. Statist. Univ. Paris, 9, no. 2, 123–160, 1960.

    Google Scholar 

  5. O. Ore, Theory of Graphs, American Mathematical Society, Providence, R. I., 1962.

  6. J. W. Archbold and C. A. B. Smith, “An extension of a theorem of König on graphs,” Mathematika, 9, no. 17, 9–10, 1962.

    Google Scholar 

  7. H. Sachs, “Regular graphs with given girth and restricted circuits,” J. London Math. Soc., 38, 4, no. 152, 423–429, 1963.

    Google Scholar 

  8. O. Ore, “Note on Hamilton circuits,” Amer. Math. Monthly, 67, 55, 1960.

    Google Scholar 

  9. G. A. Dirac, “Some theorems on abstract graphs,” Proc. London Math. Soc., 2, 69–81, 1952.

    Google Scholar 

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

    Google Scholar 

  11. G. A. Dirac, “The structure of k chromatic graphs,” Fund. Math., 40, 42–55, 1953.

    Google Scholar 

  12. G. A. Dirac, “Circuits in critical graphs,” Monatsh. Math., 59, 178–187, 1955.

    Google Scholar 

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

    Google Scholar 

  14. J. B. Kelly and L. M. Kelly, “Paths and circuits in critical graphs,” Amer. J. Math., 76, 786–792, 1954.

    Google Scholar 

  15. R. C. Read, “Maximal circuits in critical graphs,” J. London Math. Soc., 32, 456–462, 1957.

    Google Scholar 

  16. T. Gallai, “Kritische Graphen,” 1 Magyar tud. akad. Mat. Kutato inter. közl. A. 8, no. 1-2, 165–192, 1963.

    Google Scholar 

  17. A. A. Zykov, “On certain properties of linear complexes,” Matematicheskii sbornik, 24, 2, 163–188, 1949.

    Google Scholar 

  18. E. A. Nordhaus and J. W. Gaddum, “On complementary graphs,” Amer. Math. Monthly, 63, 3, 175–177, 1956.

    Google Scholar 

  19. V. G. Vizing, “On an estimate of the chromatic class of a p-graph,” In: Discrete Analysis [in Russian], no. 3, Novosibirsk, 1964.

  20. V. G. Vizing, “On the chromatic class of a multigraph,” Proceedings of the Third Siberian Conference on Mathematics and Mechanics, Tomsk, 1964.

  21. V. G. Vizing, “Critical graphs with a given chromatic class,” In: Discrete Analysis [in Russian], no 5, Novosibirsk, 1965 (in press).

Download references

Authors
  1. V. G. Vizing
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 1, No. 3, pp. 29–39, 1965

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vizing, V.G. The chromatic class of a multigraph. Cybern Syst Anal 1, 32–41 (1965). https://doi.org/10.1007/BF01885700

Download citation

  • Issue Date:

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

Keywords

Search

Navigation