The following pages link to (Q4448754):
Displaying 19 items.
- Nonrepetitive colorings of graphs of bounded tree-width (Q941387) (← links)
- List star edge-coloring of subcubic graphs (Q1656917) (← links)
- List star edge coloring of sparse graphs (Q1701121) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- List star chromatic index of sparse graphs (Q1752653) (← links)
- List star edge coloring of \(k\)-degenerate graphs (Q1999752) (← links)
- On chromatic numbers of two extensions of planar graphs (Q2000818) (← links)
- Star list chromatic number of planar subcubic graphs (Q2015785) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- A polynomial time algorithm to find the star chromatic index of trees (Q2223458) (← links)
- Upper bounds on list star chromatic index of sparse graphs (Q2287772) (← links)
- List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs (Q2414472) (← links)
- Grad and classes with bounded expansion. I: Decompositions (Q2426456) (← links)
- Folding (Q2498742) (← links)
- Star chromatic number of Harary graphs (Q5025144) (← links)
- Star chromatic number of some graphs (Q5063258) (← links)
- (Q5076577) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
- Queue layouts of planar 3-trees (Q5918924) (← links)
