Cycle double covers of graphs with Hamilton paths
From MaRDI portal
DOI10.1016/0095-8956(89)90048-8zbMATH Open0618.05033OpenAlexW2091180746MaRDI QIDQ1089005FDOQ1089005
Publication date: 1989
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(89)90048-8
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (14)
- Graphs with the Circuit Cover Property
- Hamilton cycles in double generalized Petersen graphs
- Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights.
- Trigraphs
- Double covers of cubic graphs with oddness 4
- Orientable embeddings and orientable cycle double covers of projective-planar graphs
- Double coverings of 2‐paths by Hamilton cycles*
- Some basic properties of multiple Hamiltonian covers
- The decycling number of a line graph
- Title not available (Why is that?)
- Circuit Double Covers of Graphs
- Nowhere-zero 4-flows and cycle double covers
- Double cycle covers and the petersen graph
- Cycle double covers and the semi-Kotzig frame
This page was built for publication: Cycle double covers of graphs with Hamilton paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089005)