The Hadwiger number of infinite vertex-transitive graphs

DOI10.1007/BF01305240zbMath0776.05053MaRDI QIDQ1204519

Carsten Thomassen

Publication date: 10 March 1993

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

vertex-transitive graphinfinite pathHadwiger numberinfinite complete graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items (7)

Self-avoiding walks and multiple context-free languages ⋮ Separating double rays in locally finite planar graphs ⋮ A Stallings type theorem for quasi-transitive graphs ⋮ Minor exclusion in quasi-transitive graphs ⋮ Quasi-isometries between graphs and trees ⋮ On translations of double rays in graphs ⋮ Finite contractions of graphs with polynomial growth

Cites Work

• Connectivity of infinite graphs having a transitive torsion group action
• Girth in graphs
• Graphs and groups with tree-like properties
• 2-linked graphs
• On the connectivities of finite and infinite graphs
• Automorphisms and endomorphisms of infinite locally finite graphs

This page was built for publication: The Hadwiger number of infinite vertex-transitive graphs