Graphs in which all Hamiltonian cycles have the same length

DOI10.1016/0166-218X(94)90038-8zbMath0809.90123OpenAlexW1969735597WikidataQ127525770 ScholiaQ127525770MaRDI QIDQ1337675

Stanisław Kryński

Publication date: 8 November 1994

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90038-8

zbMATH Keywords

Hamiltonian cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Weighted graphs with all Hamiltonian cycles of the same length ⋮ SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts ⋮ Three value TSP and linkages with the three value linear spanning 2-forests

Cites Work

• A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• Unnamed Item

This page was built for publication: Graphs in which all Hamiltonian cycles have the same length