Strong connectivity of polyhedral complexes

DOI10.1023/A:1022413100969zbMath0852.05058OpenAlexW102559991MaRDI QIDQ1915156

Peter Greenberg, Martin Loebl

Publication date: 25 November 1996

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022413100969

zbMATH Keywords

polyhedraconnectivityorientationsstrongly connectedpolyhedral complexesRobbins' theorem

Mathematics Subject Classification ID

Operations research and management science (90B99) Connectivity (05C40) Abelian groups (20K99)

Cites Work

• Total dual integrality and integer polyhedra
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong connectivity of polyhedral complexes