Matroid and Tutte-connectivity in Infinite Graphs
نویسنده
چکیده
We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity function. As an application we re-prove that, also for infinite graphs, Tutte-connectivity is invariant under taking dual graphs.
منابع مشابه
A Subset Expansion of the Coloured Tutte Polynomial
Bollobás and Riordan introduce a Tutte polynomial for coloured graphs and matroids in [3]. We observe that this polynomial has an expansion as a sum indexed by the subsets of the ground-set of a coloured matroid, generalizing the subset expansion of the Tutte polynomial. We also discuss similar expansions of other contraction–deletion invariants of graphs and matroids. 1. The coloured Tutte pol...
متن کاملConnectivity in frame matroids
We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte connectivity of the frame matroid of Ω (also known as the bias matroid of Ω).
متن کاملEfficient c-planarity testing algebraically
We generalize the strong Hanani-Tutte theorem to clustered graphs with two disjoint clusters, and show that an extension of our result to flat clustered graphs with three disjoint clusters is not possible. We also give a new and short proof for a result by Di Battista and Frati about efficient c-planarity testing of an embedded flat clustered graph with small faces based on the matroid intersec...
متن کاملThe Tutte Polynomial for Matroids of Bounded Branch-Width
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...
متن کاملClustered Planarity Testing Revisited
The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this result to clustered graphs with two disjoint clusters, and show that a straightforward extension to flat clustered graphs with three o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014