Undirected strict gammoids
V. Bryant (1984)
Fundamenta Mathematicae
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.
Displaying similar documents to “Note on the gammoids arising from undirected graphs”
Undirected strict gammoids
Transversal and cotransversal matroids via their representations.
Ardila, Federico (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multi-polarized graphs
Ján Černý (1976)
Aplikace matematiky
Similarity:
Matroids in terms of Cayley graphs and some related results.
Çevik, A.Sinan, Cangül, İ.Naci (2009)
General Mathematics
Similarity:
On Path-Pairability in the Cartesian Product of Graphs
Gábor Mészáros (2016)
Discussiones Mathematicae Graph Theory
Similarity:
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of path-pairability, depending on the number of vertices in the Cartesian product. We present path-pairable graph families that improve the known upper bound on the minimal maximum degree of a path-pairable graph. Further results and open questions about path-pairability are also presented.
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.