Planar graphs are acyclically edge ( + 5)-colorable
From MaRDI portal
Publication:6571271
Recommendations
- Acyclic edge-coloring of planar graphs: \(\Delta\) colors suffice when \(\Delta\) is large
- Acyclic edge-coloring of planar graphs
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors
- Further result on acyclic chromatic index of planar graphs
- Acyclic edge-colouring of planar graphs (extended abstract)
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 Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic coloring of graphs
- Acyclic colorings of subcubic graphs
- 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 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 planar graphs without 4-cycles
- 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
- Acyclic edge colorings of graphs
- Acyclic edge-coloring of planar graphs
- Acyclic edge-coloring of planar graphs: \(\Delta\) colors suffice when \(\Delta\) is large
- Acyclic edge-coloring using entropy compression
- Further result on acyclic chromatic index of planar graphs
- Improved bounds on coloring of graphs
- On an estimate of the chromatic class of a \(p\)-graph
- Optimal acyclic edge-coloring of cubic graphs
This page was built for publication: Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571271)
