Route systems and bipartite graphs
Ladislav Nebeský (1991)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “A Primer on Media Theory.”
Route systems and bipartite graphs
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 information storage and retrieval systems
Witold Lipski, Wiktor Marek (1977)
Banach Center Publications
Similarity:
Dynamic WWW structures in .
Brandes, Ulrik, Kääb, Vanessa, Löh, Andres, Wagner, Dorothea, Willhalm, Thomas (2000)
Journal of Graph Algorithms and Applications
Similarity:
A proof of menger's theorem by contraction
Frank Göring (2002)
Discussiones Mathematicae Graph Theory
Similarity:
A short proof of the classical theorem of Menger concerning the number of disjoint AB-paths of a finite graph for two subsets A and B of its vertex set is given. The main idea of the proof is to contract an edge of the graph.
Polar graphs and railway traffic
Bohdan Zelinka (1974)
Aplikace matematiky
Similarity:
Even circuits of prescribed clockwise parity.
Fischer, Ilse, Little, C.H.C. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity: