scientific article; zbMATH DE number 403948

zbMath0819.68088MaRDI QIDQ4201932

Jing Huang, Jörgen Bang-Jensen, Pavol Hell

Publication date: 6 September 1993

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

zbMATH Keywords

digraphstournamentsHamiltonian pathcircular arc graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

Subclasses of circular-arc bigraphs: Helly, normal and proper ⋮ On complementary cycles in locally semicomplete digraphs ⋮ A classification of locally semicomplete digraphs ⋮ Path-connectivity in local tournaments ⋮ 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs ⋮ Digraphs with the path‐merging property ⋮ Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs ⋮ On the structure of locally semicomplete digraphs ⋮ Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs ⋮ Completing colored graphs to meet a target property ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey ⋮ Linkages in locally semicomplete digraphs and quasi-transitive digraphs ⋮ On chordal proper circular arc graphs

This page was built for publication: