Connectivity properties of locally semicomplete digraphs

DOI10.1002/jgt.3190180306zbMath0830.05043MaRDI 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

connectivity; digraphs; locally semicomplete digraph; indegree; outdegree; \(n\)-connected

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

Related Items

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

Cites Work

• On Subtournaments of a Tournament