Some basic properties of multiple Hamiltonian covers
From MaRDI portal
Publication:2500529
DOI10.1016/J.DAM.2006.03.035zbMATH Open1096.05032OpenAlexW2010817732MaRDI QIDQ2500529FDOQ2500529
Publication date: 17 August 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.035
Recommendations
- Hamiltonian coverings of some graphs
- Publication:4489190
- More orthogonal double covers of complete graphs by Hamiltonian paths
- Double coverings of 2‐paths by Hamilton cycles*
- Publication:4726283
- A note on perfect multiple coverings of the Hamming space
- Cycle double covers of graphs with Hamilton paths
- Exact coverings of 2-paths by Hamilton cycles
- Hamiltonicity in multitriangular graphs
- A clique-covering sufficient condition for hamiltonicity of graphs
Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-disjoint Hamilton cycles in 4-regular planar graphs
- Pairs of edge-disjoint Hamiltonian circuits
- Title not available (Why is that?)
- Extending an extension of Grinberg's theorem
- Construction of third-order Hamiltonian graphs
- A necessary condition for the existence of a circuit of any specified length
- Title not available (Why is that?)
- Title not available (Why is that?)
- The sum of the solid angles of a \(d\)-polytope
Cited In (2)
This page was built for publication: Some basic properties of multiple Hamiltonian covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500529)
