The following pages link to Strong k-colourings of graphs (Q4809513):
Displaying 13 items.
- A strict strong coloring of trees (Q989572) (← links)
- Acyclic \(k\)-strong coloring of maps on surfaces (Q1581455) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces (Q1810157) (← links)
- Extension of hereditary classes with substitutions (Q1811128) (← links)
- (Q3166098) (← links)
- (Q3320410) (← links)
- (Q3421917) (← links)
- (Q3445389) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- STRONG COLORINGS OVER PARTITIONS (Q5009680) (← links)
- A new kind of graph coloring (Q5468865) (← links)
- On strongly spanning k-edge-colorable subgraphs (Q5737974) (← links)