Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles

DOI10.1016/j.tcs.2021.06.017OpenAlexW3174060610WikidataQ113863191 ScholiaQ113863191MaRDI QIDQ5918364

Guo-Hui Lin, Shuguang Han, Eiji Miyano, Qiaojun Shu, An Zhang, Yong Chen

Publication date: 11 August 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.06152

zbMATH Keywords

inductionplanar graphacyclic edge coloringdischargingintersecting triangles

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Acyclic edge coloring of planar graphs without 5-cycles
• Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
• Acyclic edge coloring through the Lovász local lemma
• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic colorings of subcubic graphs
• Further result on acyclic chromatic index of planar graphs
• Acyclic edge coloring of 4-regular graphs without 3-cycles
• Acyclic chromatic index of planar graphs with triangles
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge coloring of 4-regular graphs. II.
• Acyclic edge coloring of graphs
• Acyclic edge-coloring using entropy compression
• Acyclic edge colorings of graphs
• Acyclic Edge-Coloring of Planar Graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic coloring of graphs
• Optimal acyclic edge‐coloring of cubic graphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles