Connectivity properties of locally semicomplete digraphs

DOI10.1002/jgt.3190180306zbMath0830.05043OpenAlexW2042504828MaRDI QIDQ4290579

Lutz Volkmann, Yubao Guo

Publication date: 6 June 1994

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190180306

zbMATH Keywords

connectivitydigraphslocally semicomplete digraphindegreeoutdegree\(n\)-connected

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items

The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ A classification of locally semicomplete digraphs ⋮ Path-connectivity in local tournaments ⋮ Paths and cycles in extended and decomposable digraphs ⋮ Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs ⋮ Spanning local tournaments in locally semicomplete digraphs ⋮ Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments ⋮ The second out-neighborhood for local tournaments ⋮ Decomposing locally semicomplete digraphs into strong spanning subdigraphs ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ \(k\)-strong spanning local tournaments in locally semicomplete digraphs ⋮ Vertex-disjoint cycles in local tournaments ⋮ Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three ⋮ \(H\)-force sets of locally semicomplete digraphs ⋮ On the number of cycles in local tournaments ⋮ A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic ⋮ Vertex deletion and cycles in multipartite tournaments ⋮ \(\alpha\)-diperfect digraphs ⋮ Disjoint Paths in Decomposable Digraphs

Cites Work

• On Subtournaments of a Tournament