Connectivity properties of locally semicomplete digraphs

DOI10.1002/JGT.3190180306MaRDI QIDQ4290579zbMATH OpenOpenAlexFDO

Authors Yubao Guo, Lutz Volkmann

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

digraphsconnectivitylocally semicomplete digraphindegreeoutdegree\(n\)-connected

Mathematics Subject Classification ID

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

Recommendations

• On Vertices of outdegree n in minimally n‐connected digraphs
• scientific article; zbMATH DE number 800098
• On critically connected digraphs
• Local-edge-connectivity in digraphs and oriented graphs
• Properties of \(k\)-critically \(n\)-connected digraphs
• scientific article; zbMATH DE number 871182
• Critical vertices in k-connected digraphs
• Strongly Hamiltonian-connected locally semicomplete digraphs
• Vertices of small degree in critically n-connected digraphs
• Locally semicomplete digraphs: A generalization of tournaments

Cites work

• On Subtournaments of a Tournament

Cited in

(30)

• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• \(k\)-strong spanning local tournaments in locally semicomplete digraphs
• Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three
• \(\alpha\)-diperfect digraphs
• On the number of cycles in local tournaments
• Decomposing locally semicomplete digraphs into strong spanning subdigraphs
• Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs
• scientific article; zbMATH DE number 734456 (Why is no real title available?)
• Vertex deletion and cycles in multipartite tournaments
• Spanning local tournaments in locally semicomplete digraphs
• A classification of locally semicomplete digraphs
• Vertex-disjoint cycles in local tournaments
• Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments
• scientific article; zbMATH DE number 800098 (Why is no real title available?)
• On minimum locally n-(arc)-strong digraphs
• scientific article; zbMATH DE number 804599 (Why is no real title available?)
• Non-critical vertices and long circuits in strong tournaments of order n and diameter d
• Weakly Hamiltonian-connected locally semicomplete digraphs
• Locally semicomplete digraphs that are complementarym-pancyclic
• On the \(l\)-connectivity of a digraph
• Disjoint paths in decomposable digraphs
• Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
• Locally semicomplete digraphs: A generalization of tournaments
• Path-connectivity in local tournaments
• Paths and cycles in extended and decomposable digraphs
• The second out-neighborhood for local tournaments
• \(H\)-force sets of locally semicomplete digraphs
• Locally Semicomplete Digraphs and Generalizations
• A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
• The connectivities of locally finite primitive graphs

This page was built for publication: Connectivity properties of locally semicomplete digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290579)