On k-step Hamiltonian graphs

MaRDI QIDQ2927768zbMATH OpenFDO

Authors Gee-Choon Lau, Sin-Min Lee, Karl Schaffer, Siu-Ming Tong, Samantha Lui

Publication date 4 November 2014

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

NP-completeHamiltonian tour\(k\)-step Hamiltonian tour

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Transversal (matching) theory (05D15)

Recommendations

• On \(k\)-step Hamiltonian bipartite and tripartite graphs
• More results on 3-step Hamiltonicity of graphs and its line graphs
• On 3-step Hamiltonian trees
• On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs
• The 2-steps Hamiltonian subdivision graphs of cycles with a chord

Cited in

(11)

• scientific article; zbMATH DE number 7133095 (Why is no real title available?)
• Hamiltonian graphs from Kirkman to König
• On chromatic number and clique number in \(k\)-step Hamiltonian graphs
• On 3-step Hamiltonian trees
• Bounds for the independence number in \(k\)-step Hamiltonian graphs
• More results on 3-step Hamiltonicity of graphs and its line graphs
• A complete solution of 3-Hamiltonian grids and torus graphs
• The 2-steps Hamiltonian subdivision graphs of cycles with a chord
• On 2-steps-Hamiltonian cubic graphs
• On \(k\)-step Hamiltonian bipartite and tripartite graphs
• On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs

This page was built for publication: On \(k\)-step Hamiltonian graphs

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