Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
»
Graph Theory
Directed Graphs
Title
Author(s)
Imp.¹
Rec.²
Subtopic
Posted by
Monochromatic reachability or rainbow triangles
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Tournaments
mdevos
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Tournaments
fhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Tournaments
fhavet
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Tournaments
fhavet
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Tournaments
fhavet
The Two Color Conjecture
Neumann-Lara
✭✭
0
mdevos
Woodall's Conjecture
Woodall
✭✭✭
0
mdevos
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
JS
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
nkorppi
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
mdevos
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
fhavet
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
fhavet
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
fhavet
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
fhavet
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
fhavet
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
fhavet
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
fhavet
Navigate
Subject
Algebra
(295)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Algebraic G.T.
(8)
Basic G.T.
(39)
Coloring
(65)
Directed Graphs
(26)
Tournaments
(5)
Extremal G.T.
(9)
Graph Algorithms
(3)
Hypergraphs
(5)
Infinite Graphs
(11)
Probabilistic G.T.
(3)
Topological G.T.
(18)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more