Note on non-separating and removable cycles in highly connected graphs
From MaRDI portal
Recommendations
Cites work
- A weaker version of Lovász' path removal conjecture
- Contractible bonds in graphs
- Contractible cycles in graphs with girth at least 5
- Contractible edges and triangles in k-connected graphs
- Contractible edges in non-separating cycles
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- Nonseparating cycles inK-Connected graphs
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
- Removable circuits in multigraphs
- Triangle Density and Contractibility
Cited in
(8)- Removable cycles avoiding two connected subgraphs
- Nonseparating Cycles in 4-Connected Graphs
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
- Removable cycles in non-bipartite graphs
- Non-separating even cycles in highly connected graphs
- Non-separating subgraphs in highly connected graphs
- A note on Lovász removable path conjecture
- Nonseparating cycles avoiding specific vertices
This page was built for publication: Note on non-separating and removable cycles in highly connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003687)