Acyclic edge coloring of 4-regular graphs. II.

DOI10.1007/s40840-017-0592-7zbMath1419.05085OpenAlexW2773581105MaRDI QIDQ2272610

Qiaojun Shu, Yulai Ma, Wei Fan Wang, Yi Qiao Wang

Publication date: 20 September 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-017-0592-7

zbMATH Keywords

4-regular graphmaximum degreeacyclic edge coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (4)

Unnamed Item ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles ⋮ Acyclic edge coloring of chordal graphs with bounded degree

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic edge coloring of subcubic graphs
• Acyclic edge coloring of 4-regular graphs without 3-cycles
• Acyclic edge-coloring using entropy compression
• Acyclic edge colorings of graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic Edge-Coloring of Planar Graphs
• Acyclic edge coloring of 2-degenerate graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic coloring of graphs
• Optimal acyclic edge‐coloring of cubic graphs
• On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4

This page was built for publication: Acyclic edge coloring of 4-regular graphs. II.