Paths in powers of graph
Elena Wisztová (1980)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “On longest paths in connected graphs”
Paths in powers of graph
Degree powers in graphs with a forbidden even cycle.
Nikiforov, Vladimir (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -factors in the cube of a graph
Ladislav Nebeský (1981)
Časopis pro pěstování matematiky
Similarity:
Infinite paths in locally finite graphs and in their spanning trees
Bohdan Zelinka (2003)
Mathematica Bohemica
Similarity:
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.
Long path lemma concerning connectivity and independence number.
Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
3-Paths in Graphs with Bounded Average Degree
Stanislav Jendrol′, Mária Maceková, Mickaël Montassier, Roman Soták (2016)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every graph with minimum degree at least 2 and average degree strictly less than m contains a path of one of the types [...] Moreover, no parameter of this description can be improved.
On quasistars in -cubes
Ladislav Nebeský (1984)
Časopis pro pěstování matematiky
Similarity: