Upper bounds on the acyclic chromatic index of degenerate graphs
From MaRDI portal
Publication:6197756
DOI10.1016/j.disc.2024.113898arXiv2305.01948WikidataQ129271739 ScholiaQ129271739MaRDI QIDQ6197756
Manu Basavaraju, Unnamed Author, Shashanka Kulamarva, S. M. Hegde
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.01948
Cites Work
- Unnamed Item
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
- A new bound on the acyclic edge chromatic number
- Acyclic edge colorings of graphs
- Graph Theory
- Acyclic edge chromatic number of outerplanar graphs
- Acyclic Edge-Coloring of Planar Graphs
- Acyclic edge coloring of 2-degenerate graphs
- Acyclic and oriented chromatic numbers of graphs
- Star coloring of graphs
- Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large
- Optimal acyclic edge‐coloring of cubic graphs
- Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs”
- Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs
- Acyclic colorings of planar graphs
- All-to-all wavelength-routing in all-optical compound networks
This page was built for publication: Upper bounds on the acyclic chromatic index of degenerate graphs
