Hostname: page-component-6bf8c574d5-9nwgx Total loading time: 0 Render date: 2025-02-16T16:58:14.978Z Has data issue: false hasContentIssue false
  • English
  • Français

A generalisation of a recent characterisation of planar graphs

Published online by Cambridge University Press:  17 April 2009

C.H.C. Little
C.H.C. Little
Affiliation:
Department of Mathematics and Statistics, Massey University, Palmerston North, New Zealand.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Bulletin of the Australian Mathematical Society , Volume 27 , Issue 2 , April 1983 , pp. 225 - 230
Copyright
Copyright © Australian Mathematical Society 1983

References

[1]Chen, C.C., “On a characterization of planar graphs”, Bull. Austral. Math. Soc. 24 (1981), 289–294.CrossRefGoogle Scholar
[2]Holton, D.A. and Little, C.H.C., “Elegant odd rings and non-planar graphs”, Combinatorial Mathematics VIII, 234–268 (Proc. Eighth Australian Conf. Combinatorial Mathematics, 1980. Lecture Notes in Mathematics, 884. Springer-Verlag, Berlin, Heidelberg, New York, 1981).CrossRefGoogle Scholar