On 3-step Hamiltonian trees

MaRDI QIDQ2800999zbMATH OpenFDO

Authors Gee-Choon Lau, Yong-Song Ho, Sin-Min Lee, Karl Schaffer

Publication date 19 April 2016

Published in Journal of Graph Labeling (Search for Journal in Brave)

zbMATH Keywords

\(\mathrm{AL}(k)\)-traversable\(k\)-step Hamiltonian trees\(k\)-step traversal

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• More results on 3-step Hamiltonicity of graphs and its line graphs
• On k-step Hamiltonian graphs
• A complete solution of 3-Hamiltonian grids and torus graphs
• On 2-steps-Hamiltonian cubic graphs
• On \(k\)-step Hamiltonian bipartite and tripartite graphs

Cited in

(8)

• On k-step Hamiltonian graphs
• The 2-steps Hamiltonian subdivision graphs of cycles with a chord
• On 2-steps-Hamiltonian cubic graphs
• scientific article; zbMATH DE number 4139802 (Why is no real title available?)
• A complete solution of 3-Hamiltonian grids and torus graphs
• More results on 3-step Hamiltonicity of graphs and its line graphs
• On \(k\)-step Hamiltonian bipartite and tripartite graphs
• On chromatic number and clique number in \(k\)-step Hamiltonian graphs

This page was built for publication: On 3-step Hamiltonian trees

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