Pages that link to "Item:Q1892843"
From MaRDI portal
The following pages link to On the structure of local tournaments (Q1892843):
Displayed 22 items.
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs (Q414643) (← links)
- Circular-arc hypergraphs: rigidity via connectedness (Q516817) (← links)
- \(H\)-force sets of locally semicomplete digraphs (Q714042) (← links)
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs (Q967291) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- A note on spanning local tournaments in locally semicomplete digraphs (Q1281404) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- A classification of locally semicomplete digraphs (Q1356448) (← links)
- Path-connectivity in local tournaments (Q1356475) (← links)
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs (Q1708395) (← links)
- Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments (Q2404382) (← links)
- Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs (Q2930043) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- Disjoint quasi-kernels in digraphs (Q3522851) (← links)
- Quasi‐transitive digraphs (Q4852401) (← links)
- Disjoint Paths in Decomposable Digraphs (Q5272934) (← links)