Removable Circuits in Multigraphs
نویسندگان
چکیده
We prove the following conjecture of Bill Jackson ( J. London Math. Soc. (2) 21 (1980) p. 391). If G is a 2-connected multigraph with minimum degree at least 4 and containing no Petersen minor, then G contains a circuit C such that G E(C) is 2-connected. In fact, G has at least two edge-disjoint circuits which can serve as C. Until now, the conjecture had been veri ed only for planar graphs and for simple graphs.
منابع مشابه
Cycles having the same modularity and removable edges in 2-connected graphs
In this paper, we consider 2-connected multigraphs in which every cycle has length congruent to a modulo b (b ≥ 2). We prove that there exists such a graph which is homeomorphic to a simple graph with minimum degree at least three only if a = 0, and that there exists such a graph which is also a simple graph only if a = 0 and b = 2. We also study the distribution of paths whose internal vertice...
متن کاملRemoving circuits in 3-connected binary matroids
For a k-connected graph or matroid M , where k is a fixed positive integer, we say that a subset X of E(M) is k-removable provided M\X is k-connected. In this paper, we obtain a sharp condition on the size of a 3connected binary matroid to have a 3-removable circuit.
متن کاملRemovable Circuits in Binary Matroids
We show that if M is a connected binary matroid of cogirth at least ve which does not have both an F 7-minor and an F 7-minor, then M has a circuit C such that M ? C is connected and r(M ? C) = r(M).
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملA Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Vulnerable graphs are those directed multigraphs that can generate Braess paradox in Traffic Networks. In this paper, we give a graph-theoretic characterisation of vulnerable directed multigraphs; analogous results appeared in the literature only for undirected multigraphs and for a specific family of directed multigraphs. The proof of our characterisation also provides an algorithm that checks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 71 شماره
صفحات -
تاریخ انتشار 1997