Acyclic edge coloring of 3-sparse graphs

DOI10.1016/J.DISC.2026.115135MaRDI QIDQ7268501zbMATH OpenFDO

Authors Nevil Anto, Manu Basavaraju, Shashanka Kulamarva

Publication date 18 June 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115135

zbMATH Keywords

3-degenerate graphs3-sparse graphsacyclic chromatic indexacyclic edge coloring

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A new bound on the acyclic edge chromatic number
• Acyclic and oriented chromatic numbers of graphs
• Acyclic chromatic index of chordless graphs
• Acyclic chromatic indices of \(K_4\)-minor free graphs
• Acyclic colorings of planar graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of 2-degenerate graphs
• Acyclic edge coloring of subcubic graphs
• Acyclic edge colorings of graphs
• Acyclic edge-coloring of planar graphs
• Acyclic edge-coloring of planar graphs: \(\Delta\) colors suffice when \(\Delta\) is large
• All-to-all wavelength-routing in all-optical compound networks
• Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs”
• Graph theory
• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• Optimal acyclic edge-coloring of cubic graphs
• Star coloring of graphs
• Upper bounds on the acyclic chromatic index of degenerate graphs

This page was built for publication: Acyclic edge coloring of 3-sparse graphs

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