A classification of locally semicomplete digraphs

DOI10.1016/S0012-365X(96)00219-1zbMath0873.05072OpenAlexW2040428993MaRDI QIDQ1356448

Yubao Guo, Lutz Volkmann, Gregory Gutin, Jörgen Bang-Jensen

Publication date: 9 June 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00219-1

zbMATH Keywords

characterizationlocally semicomplete digraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (34)

Orientations of digraphs almost preserving diameter ⋮ The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ Path-connectivity in local tournaments ⋮ A characterization of locally semicomplete CKI-digraphs ⋮ Universal arcs in local tournaments ⋮ Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments ⋮ Vertex pancyclic in-tournaments ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ The second out-neighborhood for local tournaments ⋮ Decomposing locally semicomplete digraphs into strong spanning subdigraphs ⋮ Locating-dominating sets in local tournaments ⋮ Kernels and perfectness in arc-local tournament digraphs ⋮ Disjoint quasi-kernels in digraphs ⋮ Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs ⋮ Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ Cycle factors in strongly connected local tournaments ⋮ Vertex-disjoint cycles in local tournaments ⋮ Kernels in planar digraphs ⋮ Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three ⋮ On the structure of strong 3-quasi-transitive digraphs ⋮ \(H\)-force sets of locally semicomplete digraphs ⋮ Chordality of locally semicomplete and weakly quasi-transitive digraphs ⋮ Digraphs with proper connection number two ⋮ The domination number of round digraphs ⋮ On the number of cycles in local tournaments ⋮ Combinatorial optimization in system configuration design ⋮ Unnamed Item ⋮ The structure of strong arc-locally in-semicomplete digraphs ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ \(\alpha\)-diperfect digraphs ⋮ Disjoint Paths in Decomposable Digraphs

Cites Work

• On the structure of locally semicomplete digraphs
• On complementary cycles in locally semicomplete digraphs
• On \(k\)-strong and \(k\)-cyclic digraphs
• On the structure of local tournaments
• Locally semicomplete digraphs: A generalization of tournaments
• A Note on the Number of 4-Circuits in a Tournament
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Connectivity properties of locally semicomplete digraphs
• Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
• Locally semicomplete digraphs that are complementarym-pancyclic
• A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A classification of locally semicomplete digraphs