Updating the hamiltonian problem—A survey

DOI10.1002/jgt.3190150204zbMath0746.05039MaRDI QIDQ3978362

Ronald J. Gould

Publication date: 25 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150204

zbMATH Keywords

distance; random graphs; Hamiltonian paths; toughness; neighborhood intersection

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

Hamilton cycles in strong products of graphs, Unnamed Item, The shuffle exchange network has a Hamiltonian path, Chvátal–Erdős Theorem: Old Theorem with New Aspects, Graph factors and factorization: 1985--2003: a survey, Edge bounds in nonhamiltonian \(k\)-connected graphs, Some problems on Cayley graphs, On the hamiltonicity of the Cartesian product, Domination number and neighbourhood conditions, Locally pancyclic graphs, The antipodal layers problem, Claw-free graphs---a survey, Hamiltonicity of the cross product of two Hamiltonian graphs, A new Chvátal type condition for pancyclicity, On a generalization of Chvátal's condition giving new Hamiltonian degree sequences, Hamiltonicity in claw-free graphs through induced bulls, Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs, An efficient condition for a graph to be Hamiltonian, Hamiltonian properties on the class of hypercube-like networks, Hamiltonian threshold for strong products of graphs, Combinatorial families that are exponentially far from being listable in Gray code sequence

Cites Work

• Almost all regular graphs are Hamiltonian
• Limit distribution for the existence of Hamiltonian cycles in random bipartite graphs
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Cycles and paths through specified vertices in k-connected graphs
• Note on 2-connected graphs with \(d(u)+d(v)\geq n-4\)
• Hamiltonism, degree sum and neighborhood intersections
• Every generalized Petersen graph has a Tait coloring
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item