Decomposition of 3-connected graphs
From MaRDI portal
Publication:2367440
Recommendations
Cites work
- A Combinatorial Decomposition Theory
- A decomposition theory for matroids. I: General results
- A structural characterization of planar combinatorial graphs
- Decomposition of regular matroids
- Dividing a Graph into Triconnected Components
- Halin graphs and the travelling salesman problem
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Minimal Cyclic-4-Connected Graphs
- Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
- Minimally 3-connected graphs
- Non-Separable and Planar Graphs
Cited in
(19)- Minimally 3-connected graphs
- On the structure of 3-connected matroids and graphs
- On the decomposition of a 3-connected graph into cyclically 4-edge-connected components
- The structure of a decomposition of a triconnected graph
- Graph decompositions and \(D_3\)-paths with a prescribed endvertex
- On the structure of a 3-connected graph. II
- \(\vec{P_3}\)-decomposition of directed graphs
- Decomposition of a 2-connected graph into three connected subgraphs
- String decompositions of graphs
- scientific article; zbMATH DE number 3974987 (Why is no real title available?)
- scientific article; zbMATH DE number 140145 (Why is no real title available?)
- Graph decompositions without isolated vertices III
- scientific article; zbMATH DE number 1161389 (Why is no real title available?)
- 3-connected graphs and their degree sequences
- scientific article; zbMATH DE number 2165735 (Why is no real title available?)
- scientific article; zbMATH DE number 2094440 (Why is no real title available?)
- scientific article; zbMATH DE number 3895103 (Why is no real title available?)
- Decomposition of 3-connected cubic graphs
- Splitting cubic circle graphs
This page was built for publication: Decomposition of 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367440)