The following pages link to (Q4201932):
Displaying 20 items.
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- On the structure of locally semicomplete digraphs (Q1198647) (← links)
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs (Q1208466) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- In-tournament digraphs (Q1322037) (← links)
- On chordal proper circular arc graphs (Q1322203) (← links)
- On complementary cycles in locally semicomplete digraphs (Q1343256) (← links)
- A classification of locally semicomplete digraphs (Q1356448) (← links)
- Path-connectivity in local tournaments (Q1356475) (← links)
- On the structure of local tournaments (Q1892843) (← links)
- On powers of circular arc graphs and proper circular arc graphs (Q1923580) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Obstructions for acyclic local tournament orientation completions (Q2099464) (← links)
- Subclasses of circular-arc bigraphs: Helly, normal and proper (Q2132386) (← links)
- Universal arcs in local tournaments (Q2404381) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic (Q3652561) (← links)
- Digraphs with the path‐merging property (Q4852410) (← links)
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (Q4857436) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
