Star Chromatic Index
From MaRDI portal
Publication:4916092
DOI10.1002/jgt.21644zbMath1262.05049arXiv1011.3376OpenAlexW2154102540MaRDI QIDQ4916092
Robert Šámal, Bojan Mohar, Zdeněk Dvořák
Publication date: 19 April 2013
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.3376
Related Items (28)
Star chromatic index of subcubic graphs ⋮ Star Edge Coloring of Some Classes of Graphs ⋮ List star edge-coloring of subcubic graphs ⋮ Star Edge Coloring of the Cartesian Product of Graphs ⋮ On star 5-colorings of sparse graphs ⋮ Star edge-coloring of square grids ⋮ List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs ⋮ Star edge coloring of graphs with Mad(G)< 14/5 ⋮ A note on a conjecture of star chromatic index for outerplanar graphs ⋮ On a star chromatic index of subcubic graphs ⋮ Proper edge colorings of Cartesian products with rainbow \(C_4\)-s ⋮ Unnamed Item ⋮ Edge colorings avoiding patterns ⋮ Star 5-edge-colorings of subcubic multigraphs ⋮ List star edge coloring of sparse graphs ⋮ A polynomial time algorithm to find the star chromatic index of trees ⋮ Star edge coloring of corona product of path and wheel graph families ⋮ On the star chromatic index of generalized Petersen graphs ⋮ List star chromatic index of sparse graphs ⋮ List star edge coloring of \(k\)-degenerate graphs ⋮ Star edge-coloring of graphs with maximum degree four ⋮ An upper bound for the choice number of star edge coloring of graphs ⋮ On star edge colorings of bipartite and subcubic graphs ⋮ 2-distance vertex-distinguishing index of subcubic graphs ⋮ Upper bounds on list star chromatic index of sparse graphs ⋮ List star edge-coloring of claw-free subcubic multigraphs ⋮ Edge-partition and star chromatic index ⋮ List star edge coloring of generalized Halin graphs
Cites Work
- Unnamed Item
- Colouring a graph frugally
- An improved construction of progression-free sets
- Coloring with no 2-colored \(P_4\)'s
- Acyclic edge colorings of graphs
- A Note on Elkin’s Improvement of Behrend’s Construction
- Star coloring of graphs
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- The NP-Completeness of Edge-Coloring
- Acyclic coloring of graphs
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Acyclic colorings of planar graphs
This page was built for publication: Star Chromatic Index
