On a problem of R. Halin concerning infinite graphs

DOI10.1016/0012-365X(78)90181-4zbMATH Open0377.05041OpenAlexW4213239903MaRDI QIDQ1246547FDOQ1246547

Authors: Thomas Andreae 

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90181-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites Work

• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Über unendliche Wege in Graphen
• Title not available (Why is that?)
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Über trennende Eckenmengen in Graphen und den Mengerschen Satz
• Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
• A problem concerning infinite graphs
• A note on a problem of Halin's
• Bemerkung zu einem Problem aus der Theorie der unendlichen Graphen
• Ecken n-ten Grades in minimalen n-fach zusammenhängenden Graphen

Cited In (3)

• On the immersion relation and an embedding problem for infinite graphs
• On a property of graphs containing infinitely many isomorphic copies of themselves
• On a problem of R. Halin concerning infinite graphs. II

This page was built for publication: On a problem of R. Halin concerning infinite graphs

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