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

Qiaojun Shu () and Guohui Lin ()
Additional contact information
Qiaojun Shu: Hangzhou Dianzi University
Guohui Lin: University of Alberta

Journal of Combinatorial Optimization, 2024, vol. 47, issue 4, No 11, 16 pages

Abstract: 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.

Keywords: Acyclic edge coloring; Planar graph; Local structure; Discharging; Induction (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01165-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:47:y:2024:i:4:d:10.1007_s10878-024-01165-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-024-01165-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().