Contractible edges and contractible triangles in a 3-connected graph
From MaRDI portal
Publication:2051887
DOI10.1007/S00373-021-02354-1zbMATH Open1479.05174OpenAlexW3173510477MaRDI QIDQ2051887FDOQ2051887
Authors: Kiyoshi Ando, Yoshimi Egawa 
Publication date: 25 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02354-1
Recommendations
Cites Work
- Title not available (Why is that?)
- The number of vertices of degree 5 in a contraction-critically 5-connected graph
- Title not available (Why is that?)
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Zur Theorie der n-fach zusammenhängenden Graphen
- Contractible edges in 3-connected graphs
Cited In (13)
- An extremal problem on contractible edges in 3-connected graphs
- Triangle Density and Contractibility
- Contractible non-edges in \(3\)-connected graphs
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
- Title not available (Why is that?)
- The number of contractible edges in 3-connected graphs
- On the number of contractible triples in 3-connected graphs
- On 3-connected graphs with contractible edge covers of size \(k\)
- Contractible Edges in 3-Connected Cubic Graphs
- Title not available (Why is that?)
- Properly 3-contractible edges in a minimally 3-connected graph
- Contractible edges in 3-connected graphs
- Contractible edges in 3-connected graphs that preserve a minor
This page was built for publication: Contractible edges and contractible triangles in a 3-connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051887)
