Contractible edges in 2-connected locally finite graphs
Summary: In this paper, we prove that every contraction-critical 2-connected infinite graph has no vertex of finite degree and contains uncountably many ends. Then, by investigating the distribution of contractible edges in a 2-connected locally finite infinite graph \(G\), we show that the closure of the subgraph induced by all the contractible edges in the Freudenthal compactification of \(G\) is 2-arc-connected. Finally, we characterize all 2-connected locally finite outerplanar graphs nonisomorphic to \(K_3\) as precisely those graphs such that every vertex is incident to exactly two contractible edges as well as those graphs such that every finite bond contains exactly two contractible edges.
- A survey on contractible edges in graphs of a prescribed vertex connectivity
- Average degree and contractibility
- Connected but not path-connected subspaces of infinite graphs
- Distribution of contractible elements in 2-connected matroids
- Generalizaions of critical connectivity of graphs
- Graph theory
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- On end degrees and infinite cycles in locally finite graphs
- On infinite cycles. I, II
- Topological paths, cycles and spanning trees in infinite graphs
- Hamiltonicity in locally finite graphs: two extensions and a counterexample
- Contractible edges in \(k\)-connected infinite graphs
- Contractible and removable edges in 3-connected infinite graphs
- Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
- How to frame innovation in mathematics
This page was built for publication: Contractible edges in 2-connected locally finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491540)
