Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
From MaRDI portal
Publication:3879265
DOI10.1112/jlms/s2-21.3.385zbMath0438.05038OpenAlexW2091623181MaRDI QIDQ3879265
Publication date: 1980
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-21.3.385
Related Items
Compatible path-cycle-decompositions of plane graphs, Decomposition of the product of cycles based on degree partition, On removable even circuits in graphs, Removable circuits in multigraphs, Non-separating induced cycles in graphs, Removable cycles avoiding two connected subgraphs, A weaker version of Lovász' path removal conjecture, Connected hyperplanes in binary matroids, Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs, Contractible bonds in graphs, On decomposing a graph into nontrivial bonds, On removable circuits in graphs and matroids, Note on non-separating and removable cycles in highly connected graphs, Removing circuits in 3-connected binary matroids, Non-separating cocircuits in binary matroids