Acyclic List Edge Coloring of Graphs
From MaRDI portal
Publication:4916089
DOI10.1002/jgt.21641zbMath1262.05056OpenAlexW1589642618MaRDI QIDQ4916089
Publication date: 19 April 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21641
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic edge colouring of planar graphs without short cycles
- About acyclic edge colourings of planar graphs
- Acyclic edge coloring of planar graphs with large girth
- Acyclic edge colorings of planar graphs and series parallel graphs
- Acyclic edge colorings of graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic edge coloring of 2-degenerate graphs
- Optimal Acyclic Edge Colouring of Grid Like Graphs
- Acyclic edge coloring of graphs with maximum degree 4
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- d‐Regular graphs of acyclic chromatic index at least d+2
- Acyclic Edge Colouring of Outerplanar Graphs
This page was built for publication: Acyclic List Edge Coloring of Graphs