Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-23T13:25:36.117Z Has data issue: false hasContentIssue false
  • English
  • Français

Another characterisation of Pfaffian bipartite graphs

Part of: Graph theory

Published online by Cambridge University Press:  09 April 2009

Charles H. C. Little
Charles H. C. Little
Affiliation:
Department of Mathematics and StatisticsMassey UniversityPalmerston, 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.

It has been known for over twenty years that every planar graph is Pfaffian. Recently a characterisation of planar graphs in terms of strict maximal odd rings has been discovered. This paper attempts to elucidate the connection between the Pfaffian property and planarity by characterising Pfaffian bipartite graphs in terms of maximal odd rings.

MSC classification

Secondary: 05C70: Factorization, matching, partitioning, covering and packing
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 39 , Issue 1 , August 1985 , pp. 132 - 142
Copyright
Copyright © Australian Mathematical Society 1985

References

[1]Chernyak, A. A., ‘On an hypothesis of Little on planar graphs’, (Russian) Izv. Akad. Nauk BSSR Ser. Fiz. Mat. No. 2 (1980), 41–45.Google Scholar
[2]Kasteleyn, P. W., ‘Graph theory and crystal physics, pp. 43–110, Graph theory and theoretical physics, (Academic Press, New York, 1967).Google Scholar
[3]Little, C. H. C., ‘A characterization of convertible (0,1)-matrices’, J. Comb. Theory Ser. B. 18 (1975), 187–208.CrossRefGoogle Scholar
[4]Little, C. H. C., ‘A characterization of planar cubic graphs’, J. Comb. Theory Ser. B. 29 (1980), 185–194.CrossRefGoogle Scholar