IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i4d10.1007_s10878-024-01165-3.html
   My bibliography  Save this article

Planar graphs are acyclically edge $$(\Delta + 5)$$ ( Δ + 5 ) -colorable

Author

Listed:
  • Qiaojun Shu

    (Hangzhou Dianzi University)

  • Guohui Lin

    (University of Alberta)

Abstract

An edge coloring of a graph G is to color all its edges such that adjacent edges receive different colors. It is acyclic if the subgraph induced by any two colors does not contain a cycle. Fiamcik (Math Slovaca 28:139-145, 1978) and Alon et al. (J Graph Theory 37:157-167, 2001) conjectured that every simple graph with maximum degree $$\Delta $$ Δ is acyclically edge $$(\Delta + 2)$$ ( Δ + 2 ) -colorable — the well-known acyclic edge coloring conjecture. Despite many major breakthroughs and minor improvements, the conjecture remains open even for planar graphs. In this paper, we prove that planar graphs are acyclically edge $$(\Delta + 5)$$ ( Δ + 5 ) -colorable. Our proof has two main steps: Using discharging methods, we first show that every non-trivial planar graph contains a local structure in one of the eight characterized groups; we then deal with each local structure to color the edges in the graph acyclically using no more than $$\Delta + 5$$ Δ + 5 colors by an induction on the number of edges.

Suggested Citation

  • Qiaojun Shu & Guohui Lin, 2024. "Planar graphs are acyclically edge $$(\Delta + 5)$$ ( Δ + 5 ) -colorable," Journal of Combinatorial Optimization, Springer, vol. 47(4), pages 1-16, May.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:4:d:10.1007_s10878-024-01165-3
    DOI: 10.1007/s10878-024-01165-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01165-3
    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-024-01165-3?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.

    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:47:y:2024:i:4:d:10.1007_s10878-024-01165-3. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.