Kantendisjunkte Wege in Graphen

DOI10.1007/BF01295482zbMath0261.05121MaRDI QIDQ2560423

W. Mader

Publication date: 1974

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (9)

Local edge-connectivity in regular bipartite graphs ⋮ On Vertices of Degree n in Minimally n-Edge-Connected Graphs ⋮ Generalized cut trees for edge-connectivity ⋮ Indestructive deletions of edges from graphs ⋮ A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph ⋮ Unnamed Item ⋮ On k-minimally n-edge-connected graphs ⋮ Ein Extremalproblem des Zusammenhangs von Graphen ⋮ Kreuzungsfreie a,b-Wege in endlichen Graphen

Cites Work

• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Kreuzungsfreie a,b-Wege in endlichen Graphen
• Minimally n-line connected graphs.
• Unnamed Item
• Unnamed Item

This page was built for publication: Kantendisjunkte Wege in Graphen