Colouring problems
- 1 June 1978
- journal article
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 1 (2) , 72-75
- https://doi.org/10.1007/bf03023063
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A digest of the four color theoremJournal of Graph Theory, 1977
- An attempt to understand the four color problemJournal of Graph Theory, 1977
- On some recent progress in combinatoricsJournal of Graph Theory, 1977
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977
- Every planar map is four colorable. Part II: ReducibilityIllinois Journal of Mathematics, 1977
- Nonexistence of six-dimensional tangential 2-blocksJournal of Combinatorial Theory, Series B, 1976
- Infinite Families of Nontrivial Trivalent Graphs Which are not Tait ColorableThe American Mathematical Monthly, 1975
- Polyhedral decompositions of cubic graphsBulletin of the Australian Mathematical Society, 1973
- Network-ColouringsThe Mathematical Gazette, 1948
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941