Optimal Acyclic Edge Colouring of Grid Like Graphs

DOI10.1007/11809678_38zbMath1162.05317MaRDI 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

Hypercube; Mesh; Graph; Tori; Acyclic Chromatic Index; Acyclic Edge Colouring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C15: Coloring of graphs and hypergraphs

Related Items

Acyclic Edge Coloring of Triangle‐Free Planar Graphs, Acyclic List Edge Coloring of Graphs, Some results on acyclic edge coloring of plane graphs, Improved bounds for acyclic chromatic index of planar graphs, Optimal acyclic edge colouring of grid like graphs, Analysis of a heuristic for acyclic edge colouring, Acyclic edge colouring of planar graphs without short cycles, About acyclic edge colourings of planar graphs, Acyclic edge coloring of subcubic graphs, A note on acyclic edge coloring of complete bipartite graphs, Acyclic edge coloring of planar graphs without small cycles, 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, Acyclic edge chromatic number of outerplanar graphs, Acyclic edge coloring of 2-degenerate graphs