Edges not contained in triangles and the number of contractible edges in a 4-connected graph
From MaRDI portal
Publication:998425
DOI10.1016/J.DISC.2007.10.014zbMATH Open1175.05071OpenAlexW2012522460MaRDI QIDQ998425FDOQ998425
Authors: Kiyoshi Ando, Yoshimi Egawa 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.014
Recommendations
- Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges
- The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles
- Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
- THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES
- Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles
- On the number of 4-contractible edges in 4-connected graphs
- Contractible edges and triangles in \(k\)-connected graphs
- scientific article; zbMATH DE number 1530019
- Contractible non-edges in triangle-free graphs
- Contractible edges in triangle-free graphs
Cites Work
- Uncontractable 4-connected graphs
- Title not available (Why is that?)
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
- On the number of shredders
- Contractible edges in a 4-connected graph with vertices of degree greater than four
- Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
Cited In (8)
- Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
- 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
- The number of contractible edges in a 4-connected graph having a contractible edge not contained in triangles
- Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph
- THE NUMBER OF CONTRACTIBLE EDGES IN A 4-CONNECTED GRAPH HAVING A SMALL NUMBER OF EDGES NOT CONTAINED IN TRIANGLES
- Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph
- Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph
This page was built for publication: Edges not contained in triangles and the number of contractible edges in a 4-connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998425)
