# star chromatic number

> fewest colors needed such that every 4-vertex path uses ≥3 colors

**Wikidata**: [Q130442546](https://www.wikidata.org/wiki/Q130442546)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Star_chromatic_number)  
**Source**: https://4ort.xyz/entity/star-chromatic-number


## References

1. Star coloring of graphs
2. Tree-depth, subgraph coloring and homomorphism bounds