Contractible edges in a 4-connected graph with vertices of degree greater than four
From MaRDI portal
Publication:2373429
DOI10.1007/S00373-007-0699-YzbMATH Open1120.05050OpenAlexW2055198385MaRDI QIDQ2373429FDOQ2373429
Authors: Kiyoshi Ando, Yoshimi Egawa 
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0699-y
Recommendations
- 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
- On the number of 4-contractible edges in 4-connected graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
- scientific article; zbMATH DE number 1530019
- scientific article; zbMATH DE number 21742
- Contractible edges and liftable vertices in a 4-connected graph
- Contractible edges in a \(k\)-connected graph (\(K_{1} + P_{4}\))-free graph
- Contractible edges of \(k\)-connected graphs for \(k=4,5\).
- 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
Cites Work
Cited In (18)
- Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph
- Splitting and contractible edges in 4-connected graphs
- THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS
- A chain theorem for 4-connected graphs
- Edges not contained in triangles and the number of contractible edges in a 4-connected graph
- A local structure theorem on 5-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
- Contractible edges of \(k\)-connected graphs for \(k=4,5\).
- Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph
- Contractible edges and liftable vertices in a 4-connected graph
- Title not available (Why is that?)
- On the contractibility of a digraph onto \(K_ 4^*\)
- 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
- Title not available (Why is that?)
- 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
- Uncontractable 4-connected graphs
This page was built for publication: Contractible edges in a 4-connected graph with vertices of degree greater than four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373429)
