Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
From MaRDI portal
Publication:6571271
DOI10.1007/S10878-024-01165-3MaRDI QIDQ6571271
Publication date: 11 July 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds on coloring of graphs
- 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
- A new upper bound on the acyclic chromatic indices of planar graphs
- Acyclic colorings of subcubic graphs
- Further result on acyclic chromatic index of planar graphs
- Acyclic edge coloring of 4-regular graphs without 3-cycles
- Acyclic edge coloring of planar graphs without 4-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 graphs with maximum degree 4
- Acyclic coloring of graphs
- Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large
- Optimal acyclic edge‐coloring of cubic graphs
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
- On an estimate of the chromatic class of a \(p\)-graph
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)
