Searching for "Minimally 3-connected graphs." – sorted by Relevance.
-
A Note on Minimally 3-Connected Graphs
- A note on minimally 3-connected graphs ∗ Víctor Neumann-Lara 1 Eduardo Rivera-Campo 2 Jorge
- Add To MetaCart
-
Decomposition Characterizations of Classes of 2-Connected Graphs
- of minimally 3connected graphs. 1 Introduction Every graph in this paper will be a loopless finite multigraph
- Add To MetaCart
-
On a family of planar bicritical graphs
- in his work on minimally 3-connected graphs (hence our name for 2/iP). Moreover, the cubic Halin graphs
- Cited by 1 (0 self) – Add To MetaCart
-
A Polyhedral Approach to Multicommodity Survivable Network Design
- contains a [u; v]-path for each pair of nodes u; v 2 R. If G is moreover an edge-minimal 3 connected graph
- Cited by 28 (0 self) – Add To MetaCart

