Skip to main content
Log in

A Bound on the Chromatic Number of an Almost Planar Graph

Journal of Mathematical Sciences Aims and scope Submit manuscript

Let G be a graph that can be drawn on a plane in such a way that any edge intersects at most one other edge. It is proved that the chromatic number of G does not exceed 7. The bound \( \chi (G)\leq \frac{{9+\sqrt{17+64g }}}{2} \) is also proved for a graph G that can be drawn on a surface of genus g (g ≥ 1) in such a way that any edge intersects at most one other edge. Bibliography: 8 titles.

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

Access this article

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. K. Appel and W. Haken, “Every planar map is four colorable,” A. M. S. Contemp. Math., 98 (1989).

  2. K. Appel and W. Haken, “Every map is four colourable, Part I: Discharging,” Illinois J. Math., 21, 429–490 (1977).

    MATH  MathSciNet  Google Scholar 

  3. K. Appel and W. Haken, “Every map is four colourable, Part II: Reducibility,” Illinois J. Math., 21, 491–567 (1977).

    MATH  MathSciNet  Google Scholar 

  4. P. J. Heawood, “Map colour theorem,” Quart. J. Math., 24, 332–338 (1890).

    MATH  Google Scholar 

  5. D. V. Karpov, “Upper bound of the number of edges of an almost planar bipartite graph,” Zap. Nauchn. Semin. POMI, 406, 12–30 (2012).

    MathSciNet  Google Scholar 

  6. J. Pach and G. Tóth, “Graphs drawn with few crossing per edge,” Combinatorica, 17, No. 3, 427–439 (1997).

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Ringel and J. W. T. Youngs, “Solution of the Heawood map-coloring problem,” Proc. Nat. Acad. Sci. USA, 60, No. 2, 438–445 (1968).

    Article  MATH  MathSciNet  Google Scholar 

  8. N. Robertson, D. Sanders, P. Seymour, and R. Thomas, “The Four-Colour Theorem,” J. Comb. Theory, Series B, 70, 2–44 (1997).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to G. V. Nenashev.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 406, 2012, pp. 95–106.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nenashev, G.V. A Bound on the Chromatic Number of an Almost Planar Graph. J Math Sci 196, 784–790 (2014). https://doi.org/10.1007/s10958-014-1693-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-014-1693-6

Keywords

Navigation