Article contents
DUALIZABILITY OF GRAPHS
Published online by Cambridge University Press: 24 February 2011
Abstract
We investigate natural dualities for classes of simple graphs. For example, we give a natural duality for the class consisting of all n-colourable graphs and show that, for all n≥3, there is no natural duality for the class consisting of all freely n-colourable graphs. We also prove that there exist arbitrarily long finite chains of 3-colourable graphs that alternate between being dualizable and nondualizable.
Keywords
MSC classification
- Type
- Research Article
- Information
- Journal of the Australian Mathematical Society , Volume 89 , Issue 3 , December 2010 , pp. 377 - 392
- Copyright
- Copyright © Australian Mathematical Publishing Association Inc. 2011
References
- 1
- Cited by