Contractible edges and triangles in k-connected graphs
From MaRDI portal
Publication:1850609
DOI10.1006/JCTB.2001.2096zbMATH Open1031.05076OpenAlexW2162913605MaRDI QIDQ1850609FDOQ1850609
Authors: Ken-ichi Kawarabayashi 
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2001.2096
Recommendations
Cites Work
- Uncontractable 4-connected graphs
- An excluded minor theorem for the octahedron
- Generalizaions of critical connectivity of graphs
- Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
- Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
- Title not available (Why is that?)
- A theorem on n-connected graphs
- Nonseparating cycles inK-Connected graphs
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
- Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
- Note on \(k\)-contractible edges in \(k\)-connected graphs
- Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
- Contractible edges in triangle-free graphs
- Title not available (Why is that?)
Cited In (35)
- \(k\)-contractible edges in \(k\)-connected graphs not containing some specified graphs
- Contractible edges in some \(k\)-connected graphs.
- Triangle Density and Contractibility
- Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)
- A local condition for \(k\)-contractible edges
- \(k\)-connected graphs without \(K_4^-\).
- Contractible edges in minimally \(k\)-connected graphs
- Title not available (Why is that?)
- Note on \(k\)-contractible edges in \(k\)-connected graphs
- Contractible cliques in \(k\)-connected graphs
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Edges not contained in triangles and the number of contractible edges in a 4-connected graph
- Title not available (Why is that?)
- \(K_5^-\)-subdivision in 4-connected graphs
- Contractible subgraphs ink-connected graphs
- Contractible elements ink-connected graphs not containing some specified graphs
- Independent paths and \(K_{5}\)-subdivisions
- Contractible small subgraphs in \(k\)-connected graphs
- Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges
- Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
- A new forbidden pair for 6-contractible edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-separating even cycles in highly connected graphs
- Contractible non-edges in triangle-free graphs
- A Theorem About a Contractible and Light Edge
- Non-separating subgraphs in highly connected graphs
- The Kelmans-Seymour conjecture. I: Special separations
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\)
- Contractible edges in \(k\)-connected graphs with some forbidden subgraphs
- Title not available (Why is that?)
- Note on non-separating and removable cycles in highly connected graphs
- Contractible triples in highly connected graphs
- Contractible edges in triangle-free graphs
- A new forbidden subgraph for 5-contractible edges
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)
