Optimal Acyclic Edge Colouring of Grid Like Graphs

DOI10.1007/11809678_38zbMath1162.05317OpenAlexW275039769MaRDI QIDQ3591309

No author found.

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11809678_38

zbMATH Keywords

HypercubeMeshGraphToriAcyclic Chromatic IndexAcyclic Edge Colouring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Local conditions for planar graphs of acyclic edge coloring ⋮ Analysis of a heuristic for acyclic edge colouring ⋮ Acyclic edge coloring of planar graphs without small cycles ⋮ Some results on acyclic edge coloring of plane graphs ⋮ Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices ⋮ Acyclic chromatic index of planar graphs with triangles ⋮ An improved bound on acyclic chromatic index of planar graphs ⋮ On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ Acyclic List Edge Coloring of Graphs ⋮ Acyclic edge coloring of planar graphs without cycles of specific lengths ⋮ Improved bounds for acyclic chromatic index of planar graphs ⋮ Acyclic edge colouring of planar graphs without short cycles ⋮ About acyclic edge colourings of planar graphs ⋮ Optimal acyclic edge colouring of grid like graphs ⋮ Acyclic edge chromatic number of outerplanar graphs ⋮ On acyclic edge-coloring of complete bipartite graphs ⋮ Acyclic edge coloring of subcubic graphs ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ A note on acyclic edge coloring of complete bipartite graphs

This page was built for publication: Optimal Acyclic Edge Colouring of Grid Like Graphs