Separating double rays in locally finite planar graphs

DOI10.1016/0012-365X(94)00054-MMaRDI QIDQ1901031zbMATH OpenOpenAlexFDO

Authors C. Paul Bonnington, Wilfried Imrich, Mark E. Watkins

Publication date 13 August 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)00054-m

zbMATH Keywords

automorphism groupcomponentsdouble rayplanar graphsquasi-axis

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Review text

The authors consider locally finite, 1-ended graphs \(\Gamma\) such that the automorphism group of \(\Gamma\) acts with finitely many orbits on \(V(\Gamma)\). They first show that if \(\Gamma\) is 3-connected and planar, then for each double ray \(D\) in \(\Gamma\) the graph \(\Gamma- V(D)\) has at most two infinite components and exactly two, if in addition \(D\) is a quasi-axis (i.e. \(\text{dist}_D(x, y)\leq \text{Sdist}_\Gamma(x, y)\) for some constant S and all \(x, y\in V(D)\)). Adapting a method of \textit{C. Thomassen} [The Hadwiger number of infinite vertex-transitive graphs, Combinatorica 12, No. 4, 481-491 (1992; Zbl 0776.05053)] they prove that conversely almost 4-connected \(\Gamma\) are planar if for each quasi-axis \(D\) the graph \(\Gamma- V(D)\) has exactly two infinite components.

Recommendations

• Edge-disjoint double rays in infinite graphs: a Halin type result
• scientific article; zbMATH DE number 1043949
• On the path separability of planar graphs
• On translations of double rays in graphs
• Finding Separator Cuts in Planar Graphs within Twice the Optimal
• \(N\)-separators in planar graphs
• scientific article; zbMATH DE number 1979709
• scientific article; zbMATH DE number 4064516
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Twins of rayless graphs

Cites work

• 2-linked graphs
• A note on fragments of infinite graphs
• Automorphisms and endomorphisms of infinite locally finite graphs
• Duality of infinite graphs
• scientific article; zbMATH DE number 3515486 (Why is no real title available?)
• Infinite paths that contain only shortest paths
• On the connectivities of finite and infinite graphs
• The Hadwiger number of infinite vertex-transitive graphs
• Zur häufungspunktfreien Darstellung abzählbarer Graphen in der Ebene
• Über unendliche Wege in Graphen

Cited in

(9)

• Geodetic rays and fibers in one-ended planar graphs
• On translations of double rays in graphs
• A characterization of infinite planar primitive graphs
• On covers of graphs by Cayley graphs
• Entropy-driven phase transition in low-temperature antiferromagnetic Potts models
• scientific article; zbMATH DE number 1043949 (Why is no real title available?)
• scientific article; zbMATH DE number 7678748 (Why is no real title available?)
• Hyperbolic site percolation
• Infinite highly connected planar graphs of large girth

This page was built for publication: Separating double rays in locally finite planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901031)