On the structure of local tournaments

DOI10.1006/jctb.1995.1016zbMath0820.05029MaRDI QIDQ1892843

Jing Huang

Publication date: 2 July 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1995.1016

zbMATH Keywords

structure theorems; interval graphs; local tournament; circular arc graphs

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C20: Directed graphs (digraphs), tournaments

Related Items

Quasi‐transitive digraphs, Disjoint Paths in Decomposable Digraphs, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Decomposing locally semicomplete digraphs into strong spanning subdigraphs, Circular-arc hypergraphs: rigidity via connectedness, \(H\)-force sets of locally semicomplete digraphs, \(k\)-strong spanning local tournaments in locally semicomplete digraphs, Characterizations and recognition of circular-arc graphs and subclasses: a survey, A note on spanning local tournaments in locally semicomplete digraphs, Linkages in locally semicomplete digraphs and quasi-transitive digraphs, A classification of locally semicomplete digraphs, Path-connectivity in local tournaments, Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs, Weakly Hamiltonian-connected ordinary multipartite tournaments, Normal Helly circular-arc graphs and its subclasses, Fully dynamic recognition of proper circular-arc graphs, Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments, Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs, Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory, Locally Semicomplete Digraphs and Generalizations, Lexicographic Orientation Algorithms, Disjoint quasi-kernels in digraphs