Skip to main content
SpringerLink
Log in

A class of planar four-colorable graphs

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

A sufficient condition is given for a planar graph to be 4-colorable. This condition is in terms of the sums of the degrees of a subset of the vertex set of the graph.

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

Similar content being viewed by others

References

  1. M. Malec and Z. Skupién,On the maximal planar graphs and the four colour problem, Prace Mat.12 (1969), 205–209.

    MATH  MathSciNet  Google Scholar 

  2. O. Ore,Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence, 1962.

  3. O. Ore,The Four-Color Problem, Academic Press, New York, 1967.

    MATH  Google Scholar 

  4. O. Ore and J. Stemple,Numerical calculations on the four-color problem, J. Combinatorial Theory,8 (1970), 65–78.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Virgina Polytechnic Institute and State University, Blacksburg, Virginia

    Ezra Brown & Lee Johnson

Authors
  1. Ezra Brown
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lee Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brown, E., Johnson, L. A class of planar four-colorable graphs. Israel J. Math. 11, 53–56 (1972). https://doi.org/10.1007/BF02761447

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation