Removable edges in 3-connected graphs
From MaRDI portal
Recommendations
Cited in
(25)- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Removable edges in cyclically 4-edge-connected cubic graphs
- Non removable edges in 3-connected cubic graphs
- The number of removable edges in 3-connected graphs
- Coloring the faces of convex polyhedra so that like colors are far apart
- Removable edges and chords of longest cycles in 3-connected graphs
- Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
- Contractible edges and removable edges in 3-connected graphs
- Contractible and removable edges in 3-connected infinite graphs
- Removable edges in a spanning tree of a k-connected graph
- Removable edges in a 5-connected graph and a construction method of 5-connected graphs
- On spanning trees and walks of low maximum degree
- scientific article; zbMATH DE number 4181380 (Why is no real title available?)
- Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs
- scientific article; zbMATH DE number 140146 (Why is no real title available?)
- On removable edges in 3-connected cubic graphs
- scientific article; zbMATH DE number 2070515 (Why is no real title available?)
- scientific article; zbMATH DE number 2075822 (Why is no real title available?)
- scientific article; zbMATH DE number 1918634 (Why is no real title available?)
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
- A PTAS for three-edge-connected survivable network design in planar graphs
- Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
- Removable edges in cycles of a k-connected graph
- Deletable edges in 3-connected graphs and their applications
- Removable edges of cycles in 5-connected graphs
This page was built for publication: Removable edges in 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353052)
