Skip to main content Accessibility help
×
Hostname: page-component-848d4c4894-v5vhk Total loading time: 0 Render date: 2024-06-15T18:33:49.345Z Has data issue: false hasContentIssue false

On circuit covers, circuit decompositions and Euler tours of graphs

Published online by Cambridge University Press:  16 March 2010

K. Walker
Affiliation:
Keele University
Get access

Summary

Introduction

I will review certain results and problems concerning the covering of the edge set of a graph with circuits or Euler tours. The areas I shall consider are:

  • Faithful circuit covers of weighted graphs.

  • Shortest circuit covers of bridgeless graphs.

  • Compatible circuit decompositions and Euler tours of Eulerian graphs.

  • Even circuit decompositions of Eulerian graphs.

I will describe interconnections between these areas and also indicate connections with other areas of combinatorics: matroids, isotropic systems, edge colouring of graphs, latin squares, nowhere-zero flows in graphs, and the Chinese postman problem.

Throughout this survey my graphs will be finite and without loops, although they may contain multiple edges. By a closed walk in a graph G, I will mean an alternating sequence of vertices and edges which starts and ends at the same vertex and is such that consecutive vertices and edges are incident. The length of the walk is the number of edges in the sequence. A tour is a closed walk which does not repeat edges. An Euler tour of G is a tour which traverses every edge of G. We shall say that a graph is Eulerian if it has an Euler tour. A tour decomposition of G is a partition of E(G) into (edge sets of) tours. We will consider an Euler tour of G to be a tour decomposition into exactly one tour. A circuit is a tour which does not repeat vertices, except when the first vertex is repeated as the last.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×