A connected subgraph maintaining high connectivity
From MaRDI portal
Publication:2509751
DOI10.1016/j.ejc.2013.06.014zbMath1292.05157OpenAlexW1984251932MaRDI QIDQ2509751
Shinya Fujita, Ken-ichi Kawarabayashi
Publication date: 29 July 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.014
Related Items
Cites Work
- High connectivity keeping sets in \(n\)-connected graphs
- Generalizaions of critical connectivity of graphs
- Endlichkeitssätze für k-kritische Graphen
- Contractible triples in 3-connected graphs
- On \(k\)-con-critically \(n\)-connected graphs
- Contractible subgraphs in 3-connected graphs
- High connectivity keeping sets in graphs and digraphs
- Nonseparating cycles inK-Connected graphs
- How to Draw a Graph
- Unnamed Item