Previous |  Up |  Next

Article

Keywords:
locally finite graph; one-way infinite path; two-way infinite path; spanning tree; Hamiltonian path
Summary:
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.
References:
[1] D. Kömig: Theorie der endlichen und unendlichen Graphen. Teubner, Leipzig, 1936.
[2] O. Ore: Theory of Graphs. AMS, Providence, 1963. MR 0150753
Partner of
EuDML logo