List star chromatic index of sparse graphs
From MaRDI portal
Publication:1752653
DOI10.1016/j.disc.2018.03.012zbMath1387.05090OpenAlexW2796805380MaRDI QIDQ1752653
Samia Kerdjoudj, Kavita Pradeep, Andre Raspaud
Publication date: 24 May 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.03.012
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (7)
Star edge coloring of graphs with Mad(G)< 14/5 ⋮ A polynomial time algorithm to find the star chromatic index of trees ⋮ List star edge coloring of \(k\)-degenerate graphs ⋮ Star edge-coloring of graphs with maximum degree four ⋮ On star edge colorings of bipartite and subcubic graphs ⋮ Upper bounds on list star chromatic index of sparse graphs ⋮ List star edge coloring of generalized Halin graphs
Cites Work
- Unnamed Item
- Unnamed Item
- List star edge-coloring of subcubic graphs
- List star edge coloring of sparse graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- Star Edge Coloring of Some Classes of Graphs
- Star chromatic index of subcubic multigraphs
- Star Chromatic Index
- Acyclic colorings of planar graphs
This page was built for publication: List star chromatic index of sparse graphs