Infinite paths in locally finite graphs and in their spanning trees

@article{Zelinka2003,
abstract = {The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {locally finite graph; one-way infinite path; two-way infinite path; spanning tree; Hamiltonian path; locally finite graph; one-way infinite path; two-way infinite path; spanning tree; Hamiltonian path},
language = {eng},
number = {1},
pages = {71-76},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Infinite paths in locally finite graphs and in their spanning trees},
url = {http://eudml.org/doc/249224},
volume = {128},
year = {2003},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Infinite paths in locally finite graphs and in their spanning trees
JO - Mathematica Bohemica
PY - 2003
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 128
IS - 1
SP - 71
EP - 76
AB - The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs.
LA - eng
KW - locally finite graph; one-way infinite path; two-way infinite path; spanning tree; Hamiltonian path; locally finite graph; one-way infinite path; two-way infinite path; spanning tree; Hamiltonian path
UR - http://eudml.org/doc/249224
ER -