J Austral Math Soc Ser A 46 pp296--301, 1989.

An Algorithm for the Ear Decomposition of a 1-Factor Covered Graph

(Received 7 August 1987; revised 14 March 1988)

Abstract

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.

1980 AMS Subject Classification (1985 Revision): 05C99

Read the article in your browser. (Scale your print to fit your paper).

C. H. C. Little: Department of Mathematics and Statistics, Massey University, Palmerston North, New Zealand.
F. Rendl: Institut für Mathematik, Technische Universität Graz, Kopernikusgasse 24, A-8010 Graz, Austria.

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au

Last Modified: Wed Feb 19 10:27:49 2003