Acyclic edge coloring of 2-degenerate graphs

DOI10.1002/jgt.20559zbMath1234.05075arXiv0803.2433OpenAlexW1995420362MaRDI QIDQ3113277

Manu Basavaraju, L. Sunil Chandran

Publication date: 8 February 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.2433

zbMATH Keywords

seriesacyclic edge coloring2-degenerate graphsacyclic edge chromatic numberouter planar graphsparallel graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Neighbor sum distinguishing index of 2-degenerate graphs, Acyclic chromatic index of chordless graphs, Hardness transitions and uniqueness of acyclic colouring, Upper bounds on the acyclic chromatic index of degenerate graphs, Acyclic edge colouring of plane graphs, Acyclic edge coloring of 4-regular graphs without 3-cycles, Acyclic Edge Coloring of Triangle‐Free Planar Graphs, Acyclic List Edge Coloring of Graphs, About acyclic edge colourings of planar graphs, Acyclic edge coloring of 4-regular graphs. II., List total arboricity of 2-degenerate graphs, Acyclic edge coloring of chordal graphs with bounded degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Generalised acyclic edge colourings of graphs with large girth
• Acyclic edge coloring of subcubic graphs
• On acyclic colorings of planar graphs
• Every circle graph of girth at least 5 is 3-colourable
• Acyclic edge-colorings of sparse graphs
• Algorithmic aspects of acyclic edge colorings
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Acyclic edge colorings of graphs
• Acyclic and oriented chromatic numbers of graphs
• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Acyclic coloring of graphs
• 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
• Acyclic colorings of planar graphs
• All-to-all wavelength-routing in all-optical compound networks