Eine Reduktionsmethode für den Kantenzusammenhang in Graphen

DOI10.1002/mana.19790930116zbMath0434.05048OpenAlexW2079028422MaRDI QIDQ3872502

W. Mader

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1002/mana.19790930116

zbMATH Keywords

multigraphedge connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (5)

Edge-disjoint trees containing some given vertices in a graph ⋮ Konstruktion aller n-fach kantenzusammenhaengenden Digraphen ⋮ A sufficient condition for graphs to be weakly \(k\)-linked ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Edge disjoint Steiner trees in graphs without large bridges

Cites Work

• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

This page was built for publication: Eine Reduktionsmethode für den Kantenzusammenhang in Graphen