Bohdan Zelinka, Department of Applied Mathematics, Technical University of Liberec, Voronezska 13, 460 01 Liberec, Czech Republic, e-mail: firstname.lastname@example.org
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.
Keywords: locally finite graph, one-way infinite path, two-way infinite path, spanning tree, Hamiltonian path
Classification (MSC2000): 05C38, 05C05, 05C45
Full text of the article: