On covers of graphs

DOI10.1016/S0012-365X(03)00314-5zbMath1031.05109MaRDI QIDQ1422433

Jana Maxová, Jaroslav Nešetřil

Publication date: 14 February 2004

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

zbMATH Keywords

GraphCycle double coverPerfect path double cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Small oriented cycle double cover of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of the complete directed graph into k-circuits
• Aspects of structural combinatorics. (Graph homomorphisms and their use)
• What is the smallest number of dicycles in a dicycle decomposition of an eulerian digraph?
• Graphs with the Circuit Cover Property
• Perfect path double covers of graphs
• Perfect path double covers in every simple graph
• On oriented path double covers

This page was built for publication: On covers of graphs