scientific article; zbMATH DE number 1308950

MaRDI QIDQ4256006zbMATH OpenFDO

Authors Jitender Deogun, Charles Riedesel

Publication date 5 December 1999

zbMATH Keywords

Hamiltonian cyclespermutation graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3906532
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
• scientific article; zbMATH DE number 842876
• scientific article; zbMATH DE number 4137804

Cited in

(24)

• Hamilton cycles in Euler tour graphs
• Partitioning graphs into Hamiltonian ones
• The longest path problem is polynomial on cocomparability graphs
• Construction of Hamiltonian paths in graphs of permutation polyhedra
• The spurs of D. H. Lehmer. Hamiltonian paths in neighbor-swap graphs of permutations
• Hamiltonicity of digraphs for universal cycles of permutations
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm
• Complexity of Hamiltonian cycle reconfiguration
• Hamilton cycles in restricted rotator graphs
• Hamilton cycles in restricted and incomplete rotator graphs
• scientific article; zbMATH DE number 4137804 (Why is no real title available?)
• Linking subgraph isomorphism and the Hamilton tour decision problem using a linearized form of PGP^T
• On the Hamiltonicity of the permutahedron
• scientific article; zbMATH DE number 3906532 (Why is no real title available?)
• scientific article; zbMATH DE number 3924829 (Why is no real title available?)
• scientific article; zbMATH DE number 3983215 (Why is no real title available?)
• scientific article; zbMATH DE number 140140 (Why is no real title available?)
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
• Hamilton cycles in the union of random permutations
• scientific article; zbMATH DE number 842876 (Why is no real title available?)
• The permutahedron _n is Hamiltonian
• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs

This page was built for publication:

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