Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T02:36:37.134Z Has data issue: false hasContentIssue false

An algorithm for the ear decomposition of a 1-factor covered graph

Part of:Graph theory

Published online by Cambridge University Press:  09 April 2009

C. H. C. Little
Affiliation:
Department of Mathematics and Statistics, Massey University, Palmerston North, New Zealand
F. Rendl
Affiliation:
Institut für Mathematik Technische Universtät Graz, Kopernikusgasse 24 A-8010 Graz, Austria
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.

We give a constructive proof for the theorem of Lovász and Plummer which asserts the existence of an ear decomposition of a 1-factor covered graph.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1989