Contractible edges and triangles in k-connected graphs
From MaRDI portal
Publication:1850609
Recommendations
Cites work
- scientific article; zbMATH DE number 3600073 (Why is no real title available?)
- scientific article; zbMATH DE number 2230263 (Why is no real title available?)
- A theorem on n-connected graphs
- An excluded minor theorem for the octahedron
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
- Contractible edges in triangle-free graphs
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Generalizaions of critical connectivity of graphs
- Nonseparating cycles inK-Connected graphs
- Note on \(k\)-contractible edges in \(k\)-connected graphs
- Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
- Uncontractable 4-connected graphs
- Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
Cited in
(35)- Triangle Density and Contractibility
- \(k\)-contractible edges in \(k\)-connected graphs not containing some specified graphs
- A new forbidden subgraph for 5-contractible edges
- Edges not contained in triangles and the number of contractible edges in a 4-connected graph
- Contractible edges in some \(k\)-connected graphs.
- A local condition for \(k\)-contractible edges
- The Kelmans-Seymour conjecture. I: Special separations
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
- scientific article; zbMATH DE number 139920 (Why is no real title available?)
- scientific article; zbMATH DE number 2011856 (Why is no real title available?)
- Non-separating subgraphs in highly connected graphs
- scientific article; zbMATH DE number 2108141 (Why is no real title available?)
- \(k\)-connected graphs without \(K_4^-\).
- Note on non-separating and removable cycles in highly connected graphs
- scientific article; zbMATH DE number 2230280 (Why is no real title available?)
- Non-separating even cycles in highly connected graphs
- Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges
- Contractible edges in \(k\)-connected graphs with some forbidden subgraphs
- Independent paths and \(K_{5}\)-subdivisions
- Contractible small subgraphs in \(k\)-connected graphs
- Contractible cliques in \(k\)-connected graphs
- Note on \(k\)-contractible edges in \(k\)-connected graphs
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Contractible edges in triangle-free graphs
- Contractible triples in highly connected graphs
- Contractible non-edges in triangle-free graphs
- Contractible edges in minimally \(k\)-connected graphs
- scientific article; zbMATH DE number 4095507 (Why is no real title available?)
- \(K_5^-\)-subdivision in 4-connected graphs
- Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
- Contractible elements ink-connected graphs not containing some specified graphs
- A new forbidden pair for 6-contractible edges
- A Theorem About a Contractible and Light Edge
- Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)
- Contractible subgraphs ink-connected graphs
This page was built for publication: Contractible edges and triangles in \(k\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850609)
