Acyclic edge coloring of chordal graphs with bounded degree
From MaRDI portal
Publication:2053722
DOI10.1007/S00373-021-02378-7zbMATH Open1479.05116OpenAlexW3183161280MaRDI QIDQ2053722FDOQ2053722
Authors: Yulai Ma, Yongtang Shi, Weifan 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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic edge colorings of graphs
- Acyclic coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumerating minimal dominating sets in chordal graphs
- Acyclic edge-coloring using entropy compression
- Improved bounds on coloring of graphs
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge-coloring of planar graphs
- Acyclic edge coloring of 2-degenerate graphs
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic edge coloring through the Lovász local lemma
- Further result on acyclic chromatic index of planar graphs
- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Acyclic edge coloring of 4-regular graphs. II.
Cited In (6)
This page was built for publication: Acyclic edge coloring of chordal graphs with bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053722)
