Optimal acyclic edge colouring of grid like graphs

DOI10.1016/j.disc.2010.05.033zbMath1209.05095OpenAlexW2058248657MaRDI QIDQ710564

D. Kharzeev

Publication date: 19 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.05.033

zbMATH Keywords

hypercubegraphmeshacyclic chromatic indexacyclic edge colouring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On a conjecture on the balanced decomposition number ⋮ On acyclic edge coloring of toroidal graphs ⋮ Acyclic chromatic indices of fully subdivided graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph multiplication
• Acyclic colorings of subcubic graphs
• Analysis of a heuristic for acyclic edge colouring
• Cartesian graph factorization at logarithmic cost per edge
• Algorithmic aspects of acyclic edge colorings
• Improved bounds on acyclic edge colouring
• Acyclic edge colorings 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
• Acyclic Edge Colouring of Outerplanar Graphs
• Acyclic colorings of planar graphs

This page was built for publication: Optimal acyclic edge colouring of grid like graphs