Pages that link to "Item:Q2223458"
From MaRDI portal
The following pages link to A polynomial time algorithm to find the star chromatic index of trees (Q2223458):
Displayed 4 items.
- List star edge-coloring of claw-free subcubic multigraphs (Q2065794) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- The complexity of star colouring in bounded degree graphs and regular graphs (Q6102265) (← links)
- On structural parameterizations of star coloring (Q6132531) (← links)