Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
From MaRDI portal
Publication:1025937
DOI10.1016/j.disc.2008.09.005zbMath1177.05065OpenAlexW4210817883MaRDI QIDQ1025937
Xiaofeng Guo, Jianji Su, Li Qiong Xu
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.09.005
Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
Uniformly 3‐connected graphs ⋮ A result on quasi \(k\)-connected graphs ⋮ Removable edges in a spanning tree of a \(k\)-connected graph ⋮ Some joys and trials of mathematical neuroscience ⋮ Removable edges in cycles of a \(k\)-connected graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimally 3-connected graphs
- Contractible edges in triangle-free graphs
- Generalizaions of critical connectivity of graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
- A classification of 4-connected graphs
- The number of removable edges in 3-connected graphs
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Minors of quasi 4-connected graphs
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- The structure of quasi 4-connected graphs
- Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
- Trivially noncontractible edges in a contraction critically 5-connected graph
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- Contractible edges and triangles in \(k\)-connected graphs
- The number of removable edges in a 4-connected graph
- Closed separator sets
- Removable edges in a 5-connected graph and a construction method of 5-connected graphs
- A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- Contractible edges in 7-connected graphs
- Removable edges in 3-connected graphs
- Uncontractable 4-connected graphs
- A theorem on n-connected graphs
This page was built for publication: Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
