Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T14:23:58.344Z Has data issue: false hasContentIssue false

Graphs with Eulerian chains

Published online by Cambridge University Press:  17 April 2009

Roger B. Eggleton
Affiliation:
Department of Mathematics, The University of Newcastle, Newcastle, New South Wales 2308, Australia.
Donald K. Skilton
Affiliation:
Department of Mathematics, The University of Newcastle, Newcastle, New South Wales 2308, Australia.
Rights & Permissions [Opens in a new window]

Extract

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.

An eulerian chain in a graph is a continuous route which traces every edge exactly once. It may be finite or infinite, and may have 0,1 or 2 end vertices. For each kind of eulerian chain, there is a characterization of the graphs which admit such a tracing. This paper derives a uniform characterization of graphs with an eulerian chain, regardless of the kind of chain. Relationships between the edge complements of various kinds of finite subgraphs are also investigated, and hence a sharpened version of the eulerian chain characterization is derived.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1984