
digraph
Monochromatic reachability or rainbow triangles ★★★
Author(s): Sands; Sauer; Woodrow
In an edge-colored digraph, we say that a subgraph is rainbow if all its edges have distinct colors, and monochromatic if all its edges have the same color.




Keywords: digraph; edge-coloring; tournament
Monochromatic reachability in edge-colored tournaments ★★★
Author(s): Erdos






Keywords: digraph; edge-coloring; tournament
Non-edges vs. feedback edge sets in digraphs ★★★
Author(s): Chudnovsky; Seymour; Sullivan
For any simple digraph , we let
be the number of unordered pairs of nonadjacent vertices (i.e. the number of non-edges), and
be the size of the smallest feedback edge set.



Keywords: acyclic; digraph; feedback edge set; triangle free
Highly arc transitive two ended digraphs ★★
Author(s): Cameron; Praeger; Wormald


Keywords: arc transitive; digraph; infinite graph
Universal highly arc transitive digraphs ★★★
Author(s): Cameron; Praeger; Wormald
An alternating walk in a digraph is a walk so that the vertex
is either the head of both
and
or the tail of both
and
for every
. A digraph is universal if for every pair of edges
, there is an alternating walk containing both
and
Keywords: arc transitive; digraph
Woodall's Conjecture ★★★
Author(s): Woodall




The Two Color Conjecture ★★
Author(s): Neumann-Lara





