Affordable Access

Publisher Website

On circuits through five edges

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
159
Identifiers
DOI: 10.1016/0012-365x(95)00079-c

Abstract

Abstract Let L be a set of five independent edges in a 5-connected graph G. This paper proves that G has a circuit containing the edges of L if and only if G - L is connected. This is a specific case of a conjecture of Lovász and Woodall.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Circuits through specified edges

on Discrete Mathematics Jan 01, 1982

Decomposing toroidal graphs into circuits and edge...

on Discrete Applied Mathematics Jan 01, 2005

Graph colorings, spaces of edges and spaces of cir...

on Advances in Mathematics Jan 01, 2009
More articles like this..