scientific article; zbMATH DE number 4008436
From MaRDI portal
Publication:3758870
zbMATH Open0622.05043MaRDI QIDQ3758870FDOQ3758870
Authors: Alexander Kelmans 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- On non-essential edges in 3-connected graphs
- The 3-connected graphs with exactly three non-essential edges
- The 3-connected graphs with exactly \(k\) non-essential edges
- On \(3\)-connected plane graphs without triangular faces
- A constructive characterization of 3-connected triangle-free graphs
- On \(3^*\)-connected graphs
- On triangle-free regular graphs containing a cut vertex
- Minimally 3-connected graphs with exactly \(k\) non-essential edges
- scientific article; zbMATH DE number 4101239
- On triangle-free 3-connected matroids
Cited In (9)
- On 3‐graphs with no four vertices spanning exactly two edges
- On non-essential edges in 3-connected graphs
- Nonseparating cycles and planarity of graph-cells
- On edge semi-isomorphisms and semi-dualities of graphs
- A simple criterion for nodal 3-connectivity in planar graphs
- A constructive characterization of 3-connected triangle-free graphs
- Connected cutsets of a graph and triangle bases of the cycle space
- Title not available (Why is that?)
- Generating internally four-connected graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758870)
