IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v24y2012i4d10.1007_s10878-011-9409-z.html
   My bibliography  Save this article

An optimal square coloring of planar graphs

Author

Listed:
  • Yuehua Bu

    (Zhejiang Normal University)

  • Xubo Zhu

    (Zhejiang Normal University)

Abstract

The square coloring of a graph is to color the vertices of a graph at distance at most 2 with different colors. In 1977, Wegner posed a conjecture on square coloring of planar graphs. The conjecture is still open. In this paper, we prove that Wegner’s conjecture is true for planar graphs with girth at least 6.

Suggested Citation

  • Yuehua Bu & Xubo Zhu, 2012. "An optimal square coloring of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 580-592, November.
    • Handle: RePEc:spr:jcomop:v:24:y:2012:i:4:d:10.1007_s10878-011-9409-z
    DOI: 10.1007/s10878-011-9409-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-011-9409-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-011-9409-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Peng-Jun Wan, 1997. "Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network," Journal of Combinatorial Optimization, Springer, vol. 1(2), pages 179-186, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Junlei Zhu & Yuehua Bu & Miltiades P. Pardalos & Hongwei Du & Huijuan Wang & Bin Liu, 2018. "Optimal channel assignment and L(p, 1)-labeling," Journal of Global Optimization, Springer, vol. 72(3), pages 539-552, November.
    2. Dan Yi & Junlei Zhu & Lixia Feng & Jiaxin Wang & Mengyini Yang, 2019. "Optimal r-dynamic coloring of sparse graphs," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 545-555, August.
    3. Yuehua Bu & Xiaoyan Yan, 2015. "List 2-distance coloring of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1180-1195, November.
    4. Qiming Fang & Li Zhang, 2022. "Sharp upper bound of injective coloring of planar graphs with girth at least 5," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1161-1198, September.
    5. Hoang La & Mickael Montassier, 2022. "2-Distance list $$(\Delta +2)$$ ( Δ + 2 ) -coloring of planar graphs with girth at least 10," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1356-1375, September.
    6. Wei Dong & Wensong Lin, 2016. "An improved bound on 2-distance coloring plane graphs with girth 5," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 645-655, August.
    7. Wei Dong & Baogang Xu, 2017. "2-Distance coloring of planar graphs with girth 5," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1302-1322, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sun-Yuan Hsieh & Pei-Yu Yu, 2007. "Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 153-162, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:24:y:2012:i:4:d:10.1007_s10878-011-9409-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.