Local conditions for planar graphs of acyclic edge coloring
From MaRDI portal
Publication:2142486
DOI10.1007/s12190-021-01545-6zbMath1486.05067OpenAlexW3155435549MaRDI QIDQ2142486
Publication date: 27 May 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-021-01545-6
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Acyclic edge coloring of planar graphs without 5-cycles
- Acyclic edge colouring of plane graphs
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
- A new upper bound on the acyclic chromatic indices of planar graphs
- On acyclic edge-coloring of complete bipartite graphs
- Acyclic colorings of subcubic graphs
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of subcubic graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- Acyclic edge coloring of planar graphs without 4-cycles
- The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle
- Acyclic edge-coloring using entropy compression
- Acyclic edge colorings of graphs
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- A parallel algorithmic version of the local lemma
- Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
- Acyclic Edge Colouring of Outerplanar Graphs
This page was built for publication: Local conditions for planar graphs of acyclic edge coloring
