Proof of the strong 2-cover conjecture for planar graphs

DOI10.1016/0095-8956(86)90080-8zbMath0587.05041OpenAlexW1988380304MaRDI QIDQ1072568

Herbert Fleischner

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90080-8

zbMATH Keywords

planar graphedge-disjoint cycles2-cover 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

Strong Circuit Double Cover of Some Cubic Graphs, Circuit extension and circuit double cover of graphs, Cycle double covers of infinite planar graphs, Strong 5-cycle double covers of graphs, Cycle double covers and non-separating cycles, Circuit double covers in special types of cubic graphs, Circuit Double Covers of Graphs

Cites Work

• Unnamed Item
• Unnamed Item