The following pages link to Classes of Directed Graphs (Q4606952):
Displaying 50 items.
- Some machines defined by directed graphs (Q796988) (← links)
- Unwinding modal paradoxes on digraphs (Q830367) (← links)
- Acyclic coloring parameterized by directed clique-width (Q831699) (← links)
- Lexicographic product of digraphs and related boundary-type sets (Q831723) (← links)
- Directed graphs and substitutions (Q1348693) (← links)
- Chordality of locally semicomplete and weakly quasi-transitive digraphs (Q2022148) (← links)
- On characterizations for subclasses of directed co-graphs (Q2025109) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Digraphs with proper connection number two (Q2034401) (← links)
- Oriented bipartite graphs and the Goldbach graph (Q2037582) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Transformation semigroups generated by semicomplete digraphs (Q2070986) (← links)
- Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments (Q2081462) (← links)
- Smallest number of vertices in a 2-arc-strong digraph without good pairs (Q2087467) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Weak-odd chromatic index of special digraph classes (Q2104925) (← links)
- The knapsack problem with special neighbor constraints (Q2123119) (← links)
- Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked (Q2124624) (← links)
- Computing directed Steiner path covers (Q2125222) (← links)
- Hamiltonian index of directed multigraph (Q2139786) (← links)
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (Q2149881) (← links)
- Directed width parameters on semicomplete digraphs (Q2150583) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- Extended path partition conjecture for semicomplete and acyclic compositions (Q2166278) (← links)
- Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments (Q2214324) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs (Q2232245) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter (Q2243313) (← links)
- On 1-factors with prescribed lengths in tournaments (Q2284736) (← links)
- The directed 2-linkage problem with length constraints (Q2304550) (← links)
- Comparing linear width parameters for directed graphs (Q2322714) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
- Isotropy quotients of Hopf algebroids and the fundamental groupoid of digraphs (Q2675080) (← links)
- On the spectral radius of the generalized adjacency matrix of a digraph (Q2676748) (← links)
- Improved results on linkage problems (Q2699917) (← links)
- Boundary-type sets of strong product of directed graphs (Q3390054) (← links)
- (Q4881840) (← links)
- (Q5036299) (← links)
- On the Complexity of Singly Connected Vertex Deletion (Q5041193) (← links)
- Digraph of the full transformation semigroup (Q5059587) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- (Q5854623) (← links)
- Efficient algorithms for measuring the funnel-likeness of DAGs (Q5915704) (← links)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
- Results on the small quasi-kernel conjecture (Q6041861) (← links)
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs (Q6044470) (← links)
- Spanning eulerian subdigraphs in semicomplete digraphs (Q6046690) (← links)
- Component order connectivity in directed graphs (Q6068236) (← links)
