Covers of Eulerian graphs

DOI10.1016/S0095-8956(03)00068-6zbMath1031.05105MaRDI QIDQ1417961

Geng-Hua Fan

Publication date: 6 January 2004

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

zbMATH Keywords

Eulerian graphCircuit coverEdge-switching

Mathematics Subject Classification ID

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

Related Items (5)

Three ways to cover a graph ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Cycle and cocycle coverings of graphs ⋮ Path and cycle decompositions of dense graphs ⋮ Cycle packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Erdős-Gallai conjecture
• On the coverings of graphs
• Subgraph coverings and edge switchings
• The Representation of a Graph by Set Intersections

This page was built for publication: Covers of Eulerian graphs