The book thickness of a graph
- 1 December 1979
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 27 (3) , 320-331
- https://doi.org/10.1016/0095-8956(79)90021-2
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- A numerical equivalent of the four color map ProblemMonatshefte für Mathematik, 1936