Le nombre maximal de 3-colorations d'un graphe connexe
- 29 February 1972
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 1 (4) , 351-356
- https://doi.org/10.1016/0012-365x(72)90042-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Uniquely colorable graphsJournal of Combinatorial Theory, 1969
- An introduction to chromatic polynomialsJournal of Combinatorial Theory, 1968