Displaying similar documents to “On the difficulty of finding walks of length k”

Isomorphisms and traversability of directed path graphs

Hajo Broersma, Xueliang Li (2002)

Discussiones Mathematicae Graph Theory

Similarity:

The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k+1 vertices or form a directed cycle on k vertices in D. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability....

Route systems on graphs

Manoj Changat, Henry Martyn Mulder (2001)

Mathematica Bohemica

Similarity:

The well known types of routes in graphs and directed graphs, such as walks, trails, paths, and induced paths, are characterized using axioms on vertex sequences. Thus non-graphic characterizations of the various types of routes are obtained.

On independent sets and non-augmentable paths in directed graphs

H. Galeana-Sánchez (1998)

Discussiones Mathematicae Graph Theory

Similarity:

We investigate sufficient conditions, and in case that D be an asymmetrical digraph a necessary and sufficient condition for a digraph to have the following property: "In any induced subdigraph H of D, every maximal independent set meets every non-augmentable path". Also we obtain a necessary and sufficient condition for any orientation of a graph G results a digraph with the above property. The property studied in this paper is an instance of the property of a conjecture of J.M. Laborde,...