Even cycles in graphs
- 16 January 2004
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 45 (3) , 163-223
Abstract
Let G be a 3‐connected simple graph of minimum degree 4 on at least six vertices. The author proves the existence of an even cycle C in G such that G‐V(C) is connected and G‐E(C) is 2‐connected. The result is related to previous results of Jackson, and Thomassen and Toft. Thomassen and Toft proved that G contains an induced cycle C such that both G‐V(C) and G‐E(C) is 2‐connected. G does not in general contain an even cycle such that G‐V(C) is 2‐connected. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 163–223, 2004Keywords
This publication has 6 references indexed in Scilit:
- On removable circuits in graphs and matroidsJournal of Graph Theory, 1999
- Modern Graph Theory1998
- Cycles in a graph whose lengths differ by one or twoJournal of Graph Theory, 1998
- Non-separating induced cycles in graphsJournal of Combinatorial Theory, Series B, 1981
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least FourJournal of the London Mathematical Society, 1980
- kreuzungsfreiea,b-Wege in endlichen GraphenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1974