๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Equivalent factor matroids of graphs

โœ Scribed by D. K. Wagner

Publisher
Springer-Verlag
Year
1988
Tongue
English
Weight
294 KB
Volume
8
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On matroid separations of graphs
On matroid separations of graphs
โœ Klaus Truemper ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 308 KB

Let K be a connected and undirected graph, and M be the polygon matroid of K . Assume that, for some k 2 1, the matroid M is kseparable and k-connected according to the matroid separability and connectivity definitions of W. T. Tutte. In this paper we classify the matroid kseparations of M in terms

Cycles in Circuit Graphs of Matroids
Cycles in Circuit Graphs of Matroids
โœ Ping Li; Guizhen Liu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 212 KB
On ?-equivalence and ?-equivalence of gr
On ?-equivalence and ?-equivalence of graphs
โœ Du, Qingyan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 336 KB ๐Ÿ‘ 1 views

W e define a partial ordering on the set of a-polynomials as well as a vertex splitting operation on the set of graphs, and introduce the notions of (r-equivalence and (r- uniqueness of graphs. Let a ( G ) be the a-polynomial of a graph G and a ( G ) = (r(GC). Let H = (G, u , A, 5) be a vertex spli