Acyclic edge coloring of chordal graphs with bounded degree
From MaRDI portal
Publication:2053722
Recommendations
Cites work
- scientific article; zbMATH DE number 3603300 (Why is no real title available?)
- scientific article; zbMATH DE number 1775440 (Why is no real title available?)
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic coloring of graphs
- Acyclic colorings of subcubic graphs
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Acyclic edge coloring of 4-regular graphs. II.
- Acyclic edge coloring of graphs with maximum degree 4
- Acyclic edge coloring of subcubic graphs
- Acyclic edge coloring through the Lovász local lemma
- Acyclic edge colorings of graphs
- Acyclic edge-coloring of planar graphs
- Acyclic edge-coloring using entropy compression
- Enumerating minimal dominating sets in chordal graphs
- Further result on acyclic chromatic index of planar graphs
- Improved bounds on coloring of graphs
Cited in
(6)- Hardness transitions and uniqueness of acyclic colouring
- scientific article; zbMATH DE number 1341902 (Why is no real title available?)
- Acyclic coloring of claw-free graphs with small degree
- Acyclic edge coloring of 4-regular graphs. II.
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic chromatic index of chordless graphs
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)