Small cycle double covers of 4-connected planar graphs

DOI10.1007/BF01303519zbMath0794.05058MaRDI QIDQ1316653

Karen Seyffarth

Publication date: 18 April 1994

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

planar graphHamilton cyclecycle decompositioneven graphcyclic double cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Hajós' conjecture and small cycle double covers of planar graphs ⋮ Small cycle double covers of products. II: Categorical and strong products with paths and cycles ⋮ Circuit Double Covers of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Flows and generalized coloring theorems in graphs
• Hajós' conjecture and small cycle double covers of planar graphs
• A Theorem on Planar Graphs
• Maximal planar graphs of diameter two
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• Polyhedral decompositions of cubic graphs

This page was built for publication: Small cycle double covers of 4-connected planar graphs