Acyclic edge coloring of subcubic graphs

DOI10.1016/j.disc.2007.12.036zbMath1165.05007OpenAlexW2088162725MaRDI QIDQ998411

Manu Basavaraju, L. Sunil Chandran

Publication date: 28 January 2009

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

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

zbMATH Keywords

acyclic edge coloringsubcubic graphsacyclic edge chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Local conditions for planar graphs of acyclic edge coloring ⋮ Acyclic edge coloring of planar graphs without small cycles ⋮ Acyclic edge coloring of graphs with large girths ⋮ Some results on acyclic edge coloring of plane graphs ⋮ Improved bounds on linear coloring of plane graphs ⋮ Acyclic edge coloring of 1-planar graphs without 4-cycles ⋮ On acyclic edge coloring of toroidal graphs ⋮ 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 planar graphs without 4-cycles ⋮ Acyclic edge coloring of 4-regular graphs without 3-cycles ⋮ The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle ⋮ Linear colorings of subcubic graphs ⋮ Acyclic edge coloring of planar graphs without adjacent cycles ⋮ Acyclic 4-edge colouring of non-regular subcubic graphs in linear time ⋮ Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle ⋮ An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs ⋮ Optimal acyclic edge‐coloring of cubic graphs ⋮ 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 ⋮ Acyclic edge coloring of 4-regular graphs. II. ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Acyclic edge coloring of triangle-free 1-planar graphs ⋮ Acyclic edge coloring of chordal graphs with bounded degree ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of subcubic graphs
• Generalised acyclic edge colourings of graphs with large girth
• 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 and oriented chromatic numbers of graphs
• Optimal Acyclic Edge Colouring of Grid Like 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
• All-to-all wavelength-routing in all-optical compound networks