On k-rails in graphs

DOI10.1016/0095-8956(74)90082-3MaRDI QIDQ759040zbMATH OpenOpenAlexFDO

Authors Bo Aagaard Sorensen, Carsten Thomassen

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)

Cites work

• scientific article; zbMATH DE number 3232669 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3191789 (Why is no real title available?)
• Ein Extremalproblem des Zusammenhangs von Graphen
• Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
• Extensions of Menger's Theorem^†
• On a conjecture of Bollobas and Erdős
• On graphs with at most four line-disjoint paths connecting any two vertices
• Some Homeomorphism Properties of Graphs

Cited in

(3)

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

This page was built for publication: On k-rails in graphs

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