Acyclic Edge Coloring of Triangle‐Free Planar Graphs

DOI10.1002/jgt.20651zbMath1294.05069arXiv1007.2282OpenAlexW1502126187MaRDI QIDQ4650187

L. Sunil Chandran, Manu Basavaraju

Publication date: 23 November 2012

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

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

zbMATH Keywords

planar graphsacyclic edge coloringacyclic edge chromatic number

Mathematics Subject Classification ID

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

Related Items (6)

Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 ⋮ Acyclic chromatic index of planar graphs with triangles ⋮ Acyclic edge coloring of planar graphs without 5-cycles ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ Acyclic edge coloring of graphs ⋮ Acyclic edge coloring of sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalised acyclic edge colourings of graphs with large girth
• Acyclic edge colouring of planar graphs without short cycles
• About acyclic edge colourings of planar graphs
• Acyclic edge colorings of planar graphs and series parallel graphs
• On acyclic colorings of planar graphs
• Algorithmic aspects of acyclic edge colorings
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Acyclic edge colorings of graphs
• Acyclic Edge-Coloring of Planar Graphs
• Acyclic edge coloring of 2-degenerate graphs
• Acyclic and oriented chromatic numbers of graphs
• Optimal Acyclic Edge Colouring of Grid Like Graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic colorings of planar graphs
• All-to-all wavelength-routing in all-optical compound networks

This page was built for publication: Acyclic Edge Coloring of Triangle‐Free Planar Graphs