No CrossRef data available.
Article contents
A generalisation of a recent characterisation of planar graphs
Published online by Cambridge University Press: 17 April 2009
Abstract
Planar graphs have recently been characterised as those which have no strict elegant odd ring of circuits. Here we generalise that result by showing that its dual yields a theorem that is valid for all graphs.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1983