Route systems and bipartite graphs
Ladislav Nebeský (1991)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Ladislav Nebeský (1991)
Czechoslovak Mathematical Journal
Similarity:
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....
Pavol Híc (1982)
Mathematica Slovaca
Similarity: