Pages that link to "Item:Q6102265"
From MaRDI portal
The following pages link to The complexity of star colouring in bounded degree graphs and regular graphs (Q6102265):
Displaying 3 items.
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs (Q2574670) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)