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

DOI10.1016/J.DISC.2010.06.037MaRDI QIDQ710581zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• SC-Hamiltonicity and its linkages with strong Hamiltonicity of a graph
• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
• Directed hamiltonian graphs
• Necessary conditions for Hamiltonian split graphs
• Hyper-Hamiltonicity in graphs: some sufficient conditions

Cites work

• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• scientific article; zbMATH DE number 3451687 (Why is no real title available?)
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• 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
• Hamiltonian path and symmetric travelling salesman polytopes
• On constant-weight TSP-tours
• On cost matrices with two and three distinct values of Hamiltonian paths and cycles
• Recognition of Gilmore-Gomory traveling salesman problem
• SC-Hamiltonicity and its linkages with strong Hamiltonicity of a graph
• Study of an algorithm for solving the travelling salesman problem
• Weighted graphs with all Hamiltonian cycles of the same length

Cited in

(3)

• The independent quadratic assignment problem: complexity and polynomially solvable special cases
• SC-Hamiltonicity and its linkages with strong Hamiltonicity of a graph
• 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)