scientific article; zbMATH DE number 1334633

zbMath0937.05047MaRDI QIDQ4262243

Jing Huang

Publication date: 4 June 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

characterizationpolynomial-time algorithmslocally semicomplete digraphsproper circular arc graphslocal tournamentsround digraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable, Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments, Arc-Disjoint Paths in Decomposable Digraphs, The Hamiltonicity on the competition graphs of round digraphs, The domination number of round digraphs, Locally Semicomplete Digraphs and Generalizations, Lexicographic Orientation Algorithms