Skip to main content
SpringerLink
Log in

List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

It was proved in [1] that every planar graph with girth g ≥ 6 and maximum degree Δ ≥ 8821 is 2-distance (Δ + 2)-colorable. We prove that every planar graph with g ≥ 6 and Δ ≥ 24 is list 2-distance (Δ + 2)-colorable.

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. Dvorak Z., Kral’ D., Nejedly P., and Skrekovski R., “Coloring squares of planar graphs with girth six,” European J. Combin., 29, No. 4, 838–849 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  2. Borodin O. V., Broersma H. J., Glebov A. N., and van den Heuvel J., “The minimum degree and chromatic number of the square of a planar graph,” Diskret. Anal. Issled. Oper., 8, No. 4, 9–33 (2001).

    MATH  Google Scholar 

  3. Borodin O. V., Ivanova A. O., and Neustroeva T. K., “(p, q)-coloring of sparse planar graphs,” Mat. Zametki YaGU, 13, No. 2, 3–9 (2006).

    Google Scholar 

  4. Borodin O. V., Ivanova A. O., and Neustroeva T. K., “List (p, q)-coloring of sparse planar graphs,” Sibirsk. Elektron. Mat. Izv., 3, 355–361 (2006) (http://semr.math. nsc.ru).

    MATH  MathSciNet  Google Scholar 

  5. Wegner G., Graphs with Given Diameter and a Coloring Problem, Technical Report. Univ. of Dortmund, Germany (1977).

  6. Jensen T. and Toft B., Graph Coloring Problems, John Wiley and Sons, New York (1995).

    MATH  Google Scholar 

  7. Agnarsson G. and Halldórsson M. M., “Coloring powers of planar graphs,” in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, USA, January 9–11, 2000), SIAM, Philadelphia, 2000, pp. 654–662.

    Google Scholar 

  8. Agnarsson G. and Halldórsson M. M., “Coloring powers of planar graphs,” SIAM J. Discrete Math., 16, No. 4, 651–662 (2003).

    Article  MATH  MathSciNet  Google Scholar 

  9. Borodin O. V., Broersma H. J., Glebov A. N., and van den Heuvel J., “The structure of plane triangulations in terms of stars and bunches,” Diskret. Anal. Issled. Oper., 8, No. 2, 15–39 (2001).

    MATH  Google Scholar 

  10. Molloy M. and Salavatipour M. R., “Frequency channel assignment on planar networks,” Algorithms-ESA 2002., Springer-Verlag, Berlin, 2002, pp. 736–747 (Lecture Notes Comput. Sci.; 2461).

    Chapter  Google Scholar 

  11. Molloy M. and Salavatipour M. R., “A bound on the chromatic number of the square of a planar graph,” J. Combin. Theory Ser. B, 94, 189–213 (2005).

    Article  MATH  MathSciNet  Google Scholar 

  12. Borodin O. V., Ivanova A. O., and Neustroeva T. K., “2-distance coloring of sparse planar graphs,” Sibirsk. Elektron. Mat. Izv., 1, 76–90 (2004) (http://semr.math. nsc.ru).

    MATH  MathSciNet  Google Scholar 

  13. Borodin O. V., Glebov A. N., Ivanova A. O., Neustroeva T. K., and Tashkinov V. A., “Sufficient conditions for planar graphs to be 2-distance (Δ + 1)-colorable,” Sibirsk. Elektron. Mat. Izv., 1, 129–141 (2004) (http://semr.math.nsc.ru).

    MATH  MathSciNet  Google Scholar 

  14. Borodin O. V., Ivanova A. O., and Neustroeva T. K., “List 2-distance (Δ + 1)-coloring of planar graphs with given girth,” Diskret. Anal. Issled. Oper., 14, No. 3, 13–30 (2007).

    MathSciNet  Google Scholar 

  15. Borodin O. V., Ivanova A. O., and Neustroeva T. K., “Sufficient conditions for 2-distance (Δ+1)-colorability of planar graphs of girth 6,” Diskret. Anal. Issled. Oper., 12, No. 3, 32–47 (2005).

    MathSciNet  Google Scholar 

  16. Borodin O. V., Ivanova A. O., and Neustroeva T. K., “Sufficient conditions for the minimum 2-distance colorability of planar graphs with girth 6,” Sibirsk. Elektron. Mat. Izv., 3, 441–458 (2006) (http://semr.math.nsc.ru).

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Novosibirsk, Russia

    Oleg V. Borodin

  2. Institute of Mathematics at Yakutsk State University, Yakutsk, Russia

    Anna O. Ivanova

Authors
  1. Oleg V. Borodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna O. Ivanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oleg V. Borodin.

Additional information

Original Russian Text Copyright © 2009 Borodin O. V. and Ivanova A. O.

The authors were supported by the Russian Foundation for Basic Research (Grants 08-01-00673 and 09-01-00244). The second author was also supported by a grant of the President of the Russian Federation for Junior Scientists (Grant MK-2302.2008.1).

__________

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 50, No. 6, pp. 1216–1224, November–December, 2009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borodin, O.V., Ivanova, A.O. List 2-distance (Δ + 2)-coloring of planar graphs with girth 6 and Δ ≥ 24. Sib Math J 50, 958–964 (2009). https://doi.org/10.1007/s11202-009-0106-4

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11202-009-0106-4

Keywords

Search

Navigation