SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts

DOI10.1016/j.disc.2010.06.037zbMath1208.05068OpenAlexW1964602237MaRDI QIDQ710581

Daniel K. Benvenuti, Abraham P. Punnen

Publication date: 19 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.037

zbMATH Keywords

Hamiltonian graphssymmetric digraphsSC-Hamiltonian graphsstrong hamiltonicity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Recognition of Gilmore-Gomory traveling salesman problem
• 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
• Graphs in which all Hamiltonian cycles have the same length
• Weighted graphs with all Hamiltonian cycles of the same length
• Hamiltonian path and symmetric travelling salesman polytopes
• SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph
• Study of an algorithm for solving the travelling salesman problem
• On constant-weight TSP-tours
• On cost matrices with two and three distinct values of Hamiltonian paths and cycles

This page was built for publication: SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts