The following pages link to Oriented trees in digraphs (Q1946667):
Displaying 21 items.
- A Ramsey type result for oriented trees (Q338566) (← links)
- Acyclic subgraphs with high chromatic number (Q1621059) (← links)
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- Oriented bipartite graphs and the Goldbach graph (Q2037582) (← links)
- Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph (Q2073290) (← links)
- On three blocks paths \(P (k, l, r)\) (Q2081489) (← links)
- Trees contained in every orientation of a graph (Q2138584) (← links)
- Subdivisions of four blocks cycles in digraphs with large chromatic number (Q2235256) (← links)
- Subdivisions in digraphs of large out-degree or large dichromatic number (Q2315440) (← links)
- Bispindle in strongly connected digraphs with large chromatic number (Q2413152) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) (Q4997139) (← links)
- Acyclic subgraphs of tournaments with high chromatic number (Q4999677) (← links)
- Directed Ramsey number for trees (Q5915808) (← links)
- Antipaths in oriented graphs (Q6098098) (← links)
- Existence of paths with \(t\) blocks in \(k ( t )\)-chromatic digraph (Q6184345) (← links)
- Antidirected subgraphs of oriented graphs (Q6632814) (← links)
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths (Q6642519) (← links)
- On bispindles \(B(k_1,k_2;1)\) in strongly connected digraphs with large chromatic number (Q6644891) (← links)
- Secant edges: a tool for Cohen et al.'s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number (Q6661730) (← links)
