Contractible edges in \(k\)-connected infinite graphs
From MaRDI portal
Publication:1684943
DOI10.1007/s00373-017-1842-zzbMath1376.05076OpenAlexW2748149388MaRDI QIDQ1684943
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1842-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Contractible edges in 2-connected locally finite graphs
- On infinite cycles. I, II
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- 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\)]
- Distribution of contractible edges in k-connected graphs
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Topological paths, cycles and spanning trees in infinite graphs
- Contractible and removable edges in 3-connected infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
- Duality of Ends
- Contractible Edges in a k-Connected Graph
- Nonseparating cycles inK-Connected graphs
This page was built for publication: Contractible edges in \(k\)-connected infinite graphs