On k-rails in graphs

DOI10.1016/0095-8956(74)90082-3zbMath0272.05118OpenAlexW2076764297MaRDI QIDQ759040

Carsten Thomassen, Bo Aagaard Sorensen

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90082-3

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices, On extremal graphs with exactly one Steiner tree connecting any $k$ vertices, Coloring Graphs with Constraints on Connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
• On graphs with at most four line-disjoint paths connecting any two vertices
• Ein Extremalproblem des Zusammenhangs von Graphen
• On a conjecture of Bollobas and Erdős
• Some Homeomorphism Properties of Graphs
• Extensions of Menger's Theorem^†