Acyclic chromatic index of chordless graphs

DOI10.1016/j.disc.2023.113434zbMath1526.05044arXiv2302.01638MaRDI QIDQ6041561

S. M. Hegde, Shashanka Kulamarva, Manu Basavaraju

Publication date: 31 May 2023

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

Full work available at URL: https://arxiv.org/abs/2302.01638

zbMATH Keywords

linear arboricityacyclic edge coloringchordless graphsacyclic chromatic indexminimally 2-connected graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25) Connectivity (05C40)

Cites Work

• Edge-colouring and total-colouring chordless graphs
• On graphs with no induced subdivision of \(K_4\)
• Acyclic edge coloring through the Lovász local lemma
• Algorithmic aspects of acyclic edge colorings
• 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
• The NP-Completeness of Edge-Coloring
• Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large
• Optimal acyclic edge‐coloring of cubic graphs
• NP completeness of finding the chromatic index of regular graphs
• A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs
• Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs”
• Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs
• Minimally 2-connected graphs.
• On Minimal Blocks
• Acyclic colorings of planar graphs
• All-to-all wavelength-routing in all-optical compound networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Acyclic chromatic index of chordless graphs