Removable edges in a 5-connected graph and a construction method of 5-connected graphs
From MaRDI portal
Publication:2477398
DOI10.1016/j.disc.2006.09.047zbMath1136.05033OpenAlexW2091133105MaRDI QIDQ2477398
Publication date: 13 March 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.047
Related Items (6)
Uniformly 3‐connected graphs ⋮ A result on quasi \(k\)-connected graphs ⋮ Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Removable edges of cycles in 5-connected graphs ⋮ Removable edges in cycles of a \(k\)-connected graph ⋮ Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On locally \(k\)-critically \(n\)-connected graphs
- Minimally 3-connected graphs
- Contractible edges in triangle-free graphs
- Generalizaions of critical connectivity of graphs
- On a property of n-edge-connected digraphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
- Reducible chains in several types of 2-connected graphs
- A classification of 4-connected graphs
- On k-critical, n-connected graphs
- On k-minimally n-edge-connected graphs
- The number of removable edges in 3-connected graphs
- Minors of quasi 4-connected graphs
- The structure of quasi 4-connected graphs
- Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- Removable edges in 3-connected graphs
- A Construction Method For Minimally K-Edge-Connected Graphs
- Uncontractable 4-connected graphs
- A Reduction Method for Edge-Connectivity in Graphs
- Minimally 2-connected graphs.
This page was built for publication: Removable edges in a 5-connected graph and a construction method of 5-connected graphs
