Ein Extremalproblem des Zusammenhangs von Graphen

DOI10.1007/BF01187240zbMath0244.05116MaRDI QIDQ2554709

W. Mader

Publication date: 1973

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

More on the rainbow disconnection in graphs ⋮ 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 ⋮ On k-rails in graphs ⋮ Bounds for the rainbow disconnection numbers of graphs

Cites Work

• On graphs with at most four line-disjoint paths connecting any two vertices
• Kantendisjunkte Wege in Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ein Extremalproblem des Zusammenhangs von Graphen