Contractible edges in 2-connected locally finite graphs
From MaRDI portal
Publication:491540
zbMath1327.05180MaRDI QIDQ491540
Publication date: 26 August 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p47
Related Items (4)
Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Contractible edges in \(k\)-connected infinite graphs ⋮ Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls ⋮ Contractible and removable edges in 3-connected infinite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On infinite cycles. I, II
- Connected but not path-connected subspaces of infinite graphs
- Generalizaions of critical connectivity of graphs
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Topological paths, cycles and spanning trees in infinite graphs
- On end degrees and infinite cycles in locally finite graphs
- Distribution of contractible elements in 2-connected matroids
- Average degree and contractibility
This page was built for publication: Contractible edges in 2-connected locally finite graphs