Graphs with every \(k\)-matching in a Hamiltonian cycle

DOI10.1016/S0012-365X(99)00174-0zbMath0944.05086OpenAlexW2000532705MaRDI QIDQ1970707

Grzegorz Gancarzewicz, Adam Paweł Wojda

Publication date: 21 March 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00174-0

zbMATH Keywords

Hamiltonian cycle\(k\)-matching

Mathematics Subject Classification ID

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

This page was built for publication: Graphs with every \(k\)-matching in a Hamiltonian cycle