Hamiltonian lines in infinite graphs with few vertices of smll valency

DOI10.1007/BF01818692zbMath0236.05118OpenAlexW2080598724MaRDI QIDQ2552140

C. St. J. A. Nash-Williams

Publication date: 1971

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136221

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

The center of an infinite graph, On hamiltonian circuits in Cayley diagrams, Extremal infinite graph theory, Hamilton circles in infinite planar graphs, CONTACT SURGERY GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hamilton's ideals
• A Theorem on Planar Graphs
• The Decomposition of Graphs into a Finite Number of Paths
• On an ordering of the vertices of a graph
• On Hamiltonian Circuits in Finite Graphs
• Euler Lines in Infinite Directed Graphs
• Infinite graphs—A survey
• Decomposition of Graphs into Two-Way Infinite Paths
• Some Theorems on Abstract Graphs