Classes of line graphs with small cycle double covers

MaRDI QIDQ2760460zbMATH OpenFDO

Authors Gary MacGillivray, K. Seyffarth

Publication date 2 January 2002

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

line graphsmall cycle double cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

The small cycle double cover conjecture, due to Bondy in 1990, states that every simple bridgeless graph of order \(n\) has a cycle double cover with at most \(n-1\) cycles. The authors show that this conjecture holds for line graphs of a number of types of graphs; specifically for line graphs of complete graphs, of complete bipartite graphs, and of planar graphs.

Recommendations

• Line graphs of complete multipartite graphs have small cycle double covers
• Small cycle double covers of 4-connected planar graphs
• On cycle double covers of line graphs
• scientific article; zbMATH DE number 140148
• scientific article; zbMATH DE number 4214053

Cited in

(8)

• Small cycle double covers of products. II: Categorical and strong products with paths and cycles
• On cycle double covers of line graphs
• Line graphs of complete multipartite graphs have small cycle double covers
• 2-Walk linear graphs with small number of cycles
• Path covers of weighted graphs
• Circuit double covers of graphs
• On cycle-double covers of graphs of small oddness
• Small oriented cycle double cover of graphs

This page was built for publication: Classes of line graphs with small cycle double covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760460)