On the structure of local tournaments

DOI10.1006/jctb.1995.1016zbMath0820.05029OpenAlexW2037424045MaRDI 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 theoremsinterval graphslocal tournamentcircular arc graphs

Mathematics Subject Classification ID

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

Related Items (24)

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

This page was built for publication: On the structure of local tournaments