A note on k-strongly connected orientations of an undirected graph

DOI10.1016/0012-365X(82)90044-9zbMath0481.05030OpenAlexW1978280019MaRDI QIDQ1161751

András Frank

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90044-9

zbMATH Keywords

k-strongly connected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Eulerian Orientations and Circulations ⋮ Shattering, graph orientations, and connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Recent results on well-balanced orientations

Cites Work

• Unnamed Item
• On the orientation of graphs

This page was built for publication: A note on k-strongly connected orientations of an undirected graph