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

DOI10.1016/J.DISC.2010.06.037zbMATH Open1208.05068OpenAlexW1964602237MaRDI QIDQ710581FDOQ710581

D. 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• Recognition of Gilmore-Gomory traveling salesman problem
• Hamiltonian path and symmetric travelling salesman polytopes
• A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
• Graphs in which all Hamiltonian cycles have the same length
• Weighted graphs with all Hamiltonian cycles of the same length
• 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

Cited In (1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710581)