Acyclic edge coloring of chordal graphs with bounded degree

DOI10.1007/s00373-021-02378-7zbMath1479.05116OpenAlexW3183161280MaRDI QIDQ2053722

Yulai Ma, Yongtang Shi, Wei Fan Wang

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02378-7

zbMATH Keywords

chordal graphsmaximum degreeacyclic edge coloringsimplicial vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

Hardness transitions and uniqueness of acyclic colouring

Cites Work

• Unnamed Item
• Unnamed Item
• Improved bounds on coloring of graphs
• Acyclic edge coloring through the Lovász local lemma
• A new upper bound on the acyclic chromatic indices of planar graphs
• Enumerating minimal dominating sets in chordal graphs
• Acyclic colorings of subcubic graphs
• Further result on acyclic chromatic index of planar graphs
• Acyclic edge coloring of subcubic graphs
• Acyclic edge coloring of 4-regular graphs without 3-cycles
• Acyclic edge coloring of 4-regular graphs. II.
• Acyclic edge-coloring using entropy compression
• Acyclic edge colorings of 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