Hajós' conjecture and small cycle double covers of planar graphs

DOI10.1016/0012-365X(92)90610-RzbMath0766.05067WikidataQ122927381 ScholiaQ122927381MaRDI QIDQ1197036

Karen Seyffarth

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

planar graphscycle double covercycle decompositionHajós' conjecture

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 (5)

Long cycles, heavy cycles and cycle decompositions in digraphs ⋮ Decomposing toroidal graphs into circuits and edges ⋮ Small oriented cycle double cover of graphs ⋮ Circuit Double Covers of Graphs ⋮ Small cycle double covers of 4-connected planar graphs

Cites Work

• Flows and generalized coloring theorems in graphs
• Small cycle double covers of 4-connected planar graphs
• On Eulerian and regular perfect path double covers of graphs
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• Polyhedral decompositions of cubic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hajós' conjecture and small cycle double covers of planar graphs