On semiextensions and circuit double covers

DOI10.1016/j.jctb.2006.08.002zbMath1113.05053OpenAlexW2006057030MaRDI QIDQ875950

Enrique García Moreno Esteva, Tommy R. Jensen

Publication date: 16 April 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.08.002

zbMATH Keywords

circuit double covercycles in graphssemiextension

Mathematics Subject Classification ID

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

Related Items

Circuit extension and circuit double cover of graphs ⋮ On stable cycles and cycle double covers of graphs with large circumference ⋮ Generation and properties of snarks ⋮ Splits of circuits ⋮ A note on semiextensions of stable circuits ⋮ Circuit Double Covers of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Eulerian graphs and related topics. Part 1, Volume 1
• Polyhedral decompositions of cubic graphs
• On Hamiltonian Circuits
• Stable dominating circuits in snarks

This page was built for publication: On semiextensions and circuit double covers