The following pages link to Quasi‐transitive digraphs (Q4852401):
Displayed 33 items.
- Hamiltonian paths in \(k\)-quasi-transitive digraphs (Q284740) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs (Q393927) (← links)
- \(k\)-colored kernels (Q442210) (← links)
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs (Q442356) (← links)
- On the structure of strong 3-quasi-transitive digraphs (Q708416) (← links)
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- Kernels by monochromatic paths in \(m\)-colored unions of quasi-transitive digraphs (Q968164) (← links)
- Some sufficient conditions for the existence of kernels in infinite digraphs (Q1025568) (← links)
- Vertex deletion and cycles in multipartite tournaments (Q1292878) (← links)
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs (Q1297397) (← links)
- Vertex heaviest paths and cycles in quasi-transitive digraphs (Q1356546) (← links)
- On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647) (← links)
- Paths and cycles in extended and decomposable digraphs (Q1356688) (← links)
- Kings in quasi-transitive digraphs (Q1584249) (← links)
- Orientations of digraphs almost preserving diameter (Q1613394) (← links)
- The structure of strong arc-locally semicomplete digraphs (Q1827761) (← links)
- Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) (← links)
- Infinite quasi-transitive digraphs with domination number 2 (Q2357773) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275) (← links)
- Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs (Q2494815) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- Kernels in quasi-transitive digraphs (Q2501570) (← links)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)
- Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d (Q2911489) (← links)
- Arc-Disjoint Paths in Decomposable Digraphs (Q2922218) (← links)
- Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs (Q2930043) (← links)
- Disjoint quasi-kernels in digraphs (Q3522851) (← links)
- Sufficient Conditions for a Digraph to be Supereulerian (Q5251197) (← links)
- Disjoint Paths in Decomposable Digraphs (Q5272934) (← links)
- Supereulerian digraphs with given local structures (Q5964816) (← links)