On critical 3-connected graphs with two vertices of degree 3. I
From MaRDI portal
Publication:2632550
Recommendations
Cites work
- Blocks in \(k\)-connected graphs
- Critically n-Connected Graphs
- scientific article; zbMATH DE number 5161490 (Why is no real title available?)
- scientific article; zbMATH DE number 3630796 (Why is no real title available?)
- scientific article; zbMATH DE number 1960407 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Non-\(\kappa\)-critical vertices in graphs
- On critically h-connected simple graphs
- On induced subgraphs of a block
- The decomposition of graphs into \(k\)-connected components
Cited in
(7)- On critical 3-connected graphs with two vertices of degree 3. II
- Some structures of \(3-({\gamma}_c, 2)\)-critical graphs which are not \(3-{\gamma}_c\)-critical
- On degrees of vertices in critically k-connected graphs
- scientific article; zbMATH DE number 4031741 (Why is no real title available?)
- The structure of saturated critical blocks
- On determination and construction of critically 2-connected graphs
- Reducible 3-critical graphs
This page was built for publication: On critical 3-connected graphs with two vertices of degree 3. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632550)
