Measures of traceability in graphs.
Saenpholphat, Varaporn; Okamoto, Futaba; Zhang, Ping
Mathematica Bohemica (2006)
- Volume: 131, Issue: 1, page 63-83
- ISSN: 0862-7959
Access Full Article
topHow to cite
topSaenpholphat, Varaporn, Okamoto, Futaba, and Zhang, Ping. "Measures of traceability in graphs.." Mathematica Bohemica 131.1 (2006): 63-83. <http://eudml.org/doc/223283>.
@article{Saenpholphat2006,
author = {Saenpholphat, Varaporn, Okamoto, Futaba, Zhang, Ping},
journal = {Mathematica Bohemica},
keywords = {traceable graph; Hamiltonian graph; Hamiltonian-connected graph; distance; traceable number; bounds; characterizations; Hamiltonian number},
language = {eng},
number = {1},
pages = {63-83},
publisher = {Mathematical Institute, Academy of Sciences of the Czech Republic},
title = {Measures of traceability in graphs.},
url = {http://eudml.org/doc/223283},
volume = {131},
year = {2006},
}
TY - JOUR
AU - Saenpholphat, Varaporn
AU - Okamoto, Futaba
AU - Zhang, Ping
TI - Measures of traceability in graphs.
JO - Mathematica Bohemica
PY - 2006
PB - Mathematical Institute, Academy of Sciences of the Czech Republic
VL - 131
IS - 1
SP - 63
EP - 83
LA - eng
KW - traceable graph; Hamiltonian graph; Hamiltonian-connected graph; distance; traceable number; bounds; characterizations; Hamiltonian number
UR - http://eudml.org/doc/223283
ER -
Citations in EuDML Documents
topNotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.