scientific article

zbMath0556.05047MaRDI QIDQ3220629

Herbert Fleischner

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphscycle decompositionremovable cyclesFour Color TheoremSabidussi's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

Compatible path-cycle-decompositions of plane graphs ⋮ Eulerian colorings and the bipartizing matchings conjecture of Fleischner ⋮ On semiextensions and circuit double covers ⋮ Circuit extension and circuit double cover of graphs ⋮ Hamilton cycles in 5-connected line graphs ⋮ How many conjectures can you stand? A survey ⋮ Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ Strong 5-cycle double covers of graphs ⋮ The smallest nontrivial snarks of oddness 4 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Circle graphs and the cycle double cover conjecture ⋮ Equivalence of Fleischner's and Thomassen's conjectures ⋮ Cycle double covers and non-separating cycles ⋮ Circuit double covers in special types of cubic graphs ⋮ Circuit Double Covers of Graphs ⋮ Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks ⋮ Equivalence of Jackson's and Thomassen's conjectures

This page was built for publication: