Some basic properties of multiple Hamiltonian covers
From MaRDI portal
Publication:2500529
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
Cites work
- scientific article; zbMATH DE number 4173021 (Why is no real title available?)
- scientific article; zbMATH DE number 3129886 (Why is no real title available?)
- scientific article; zbMATH DE number 4214053 (Why is no real title available?)
- scientific article; zbMATH DE number 3627230 (Why is no real title available?)
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3276424 (Why is no real title available?)
- scientific article; zbMATH DE number 3321022 (Why is no real title available?)
- scientific article; zbMATH DE number 3201172 (Why is no real title available?)
- A necessary condition for the existence of a circuit of any specified length
- Construction of third-order Hamiltonian graphs
- Edge-disjoint Hamilton cycles in 4-regular planar graphs
- Extending an extension of Grinberg's theorem
- Graph theory
- Pairs of edge-disjoint Hamiltonian circuits
- 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)