On k-step Hamiltonian bipartite and tripartite graphs

MaRDI QIDQ5360931zbMATH OpenFDO

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

Publication date 26 September 2017

Full work available at URL http://www.malayajournal.org/download.php?id=95

zbMATH Keywords

2-step Hamiltonian tourbipartite and tripartite graphsHamiltonian tourNP-complete problemsuper-edge-magic labeling

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On k-step Hamiltonian graphs
• More results on 3-step Hamiltonicity of graphs and its line graphs
• On 3-step Hamiltonian trees
• A complete solution of 3-Hamiltonian grids and torus graphs
• The 2-steps Hamiltonian subdivision graphs of cycles with a chord

Cited in

(7)

• On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs
• On 3-step Hamiltonian trees
• On k-step Hamiltonian graphs
• A complete solution of 3-Hamiltonian grids and torus graphs
• More results on 3-step Hamiltonicity of graphs and its line graphs
• scientific article; zbMATH DE number 7133095 (Why is no real title available?)
• On chromatic number and clique number in \(k\)-step Hamiltonian graphs

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

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