Optimal Acyclic Edge Colouring of Grid Like Graphs

DOI10.1007/11809678_38zbMATH Open1162.05317OpenAlexW275039769MaRDI QIDQ3591309FDOQ3591309

Authors:

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

Recommendations

• Optimal acyclic edge colouring of grid like graphs
• Acyclic edge coloring of graphs
• Acyclic edge colorings of graphs
• Optimal edge coloring of large graphs
• Optimal acyclic edge-coloring of cubic graphs
• Algorithmic aspects of acyclic edge colorings
• Acyclic and \(k\)-distance coloring of the grid
• Acyclic edge coloring of sparse graphs
• Acyclic edge-coloring of planar graphs
• An algorithm for optimal acyclic edge-colouring of cubic graphs

zbMATH Keywords

MeshGraphHypercubeToriAcyclic Chromatic IndexAcyclic Edge Colouring

Mathematics Subject Classification ID

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

Cited In (22)

• Optimal acyclic edge colouring of grid like graphs
• Improved bounds for acyclic chromatic index of planar graphs
• Some results on acyclic edge coloring of plane graphs
• Local conditions for planar graphs of acyclic edge coloring
• 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
• On acyclic edge-coloring of complete bipartite graphs
• An improved bound on acyclic chromatic index of planar graphs
• Analysis of a heuristic for acyclic edge colouring
• Acyclic list edge coloring of graphs
• Acyclic edge coloring of triangle-free planar 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
• Acyclic edge coloring of planar graphs without cycles of specific lengths
• On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of 2-degenerate graphs
• Acyclic and \(k\)-distance coloring of the grid
• The linzertorte problem, or a unified approach to painting, baking and weaving

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591309)