Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem

DOI10.1016/0012-365X(92)90587-6zbMath0764.05051WikidataQ124812149 ScholiaQ124812149MaRDI QIDQ1197011

Herbert Fleischner

Publication date: 16 January 1993

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

zbMATH Keywords

bridgeless graphsplitting lemmaspanning eulerian subgrapheulerian graphPetersen's theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

Maximum even factors of graphs ⋮ Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs ⋮ Even Factors of Large Size ⋮ Quasi-Eulerian hypergraphs ⋮ Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ On extremal \(k\)-supereulerian graphs ⋮ Even factors in edge-chromatic-critical graphs with a small number of divalent vertices ⋮ On Dominating Even Subgraphs in Cubic Graphs ⋮ Large even factors of graphs ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ On the number of components in 2-factors of claw-free graphs ⋮ Even factors of graphs ⋮ Unnamed Item ⋮ Induced claws and existence of even factors of graphs ⋮ The existence of even factors in iterated line graphs ⋮ The structure of even factors in claw-free graphs ⋮ Spanning even subgraphs of 3‐edge‐connected graphs ⋮ On edge connectivity and parity factor

Cites Work

• Unnamed Item
• Flows and generalized coloring theorems in graphs
• Eulerian graphs and related topics. Part 1, Volume 1
• Eulerian graphs and related topics. Part 1, Volume 2
• Bounds of the number of disjoint spanning trees
• On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs

This page was built for publication: Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem