Directed Graphs


TitleAuthor(s)Imp.¹Rec.²Subtopicsort iconPosted by
The Two Color ConjectureNeumann-Lara✭✭0mdevos
Woodall's ConjectureWoodall✭✭✭0mdevos
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0JS
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1nkorppi
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0mdevos
Oriented trees in n-chromatic digraphsBurr✭✭✭0fhavet
Antidirected trees in digraphsAddario-Berry; Havet; Linhares Sales; Reed; Thomassé✭✭0fhavet
Directed path of length twice the minimum outdegreeThomassé✭✭✭0fhavet
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0fhavet
Ádám's ConjectureÁdám✭✭✭0fhavet
Splitting a digraph with minimum outdegree constraintsAlon✭✭✭0fhavet
Long directed cycles in diregular digraphsJackson✭✭✭0fhavet
Arc-disjoint out-branching and in-branchingThomassen✭✭0fhavet
Subdivision of a transitive tournament in digraphs with large outdegree. Mader✭✭0fhavet
Hamilton cycle in small d-diregular graphsJackson✭✭0fhavet
Hoàng-Reed ConjectureHoang; Reed✭✭✭0fhavet
Arc-disjoint directed cycles in regular directed graphsAlon; McDiarmid; Molloy✭✭0fhavet
Cyclic spanning subdigraph with small cyclomatic numberBondy✭✭0fhavet
Large acyclic induced subdigraph in a planar oriented graph.Harutyunyan✭✭0fhavet
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0fhavet
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Tournamentsmdevos
Decomposing an even tournament in directed paths.Alspach; Mason; Pullman✭✭✭0Tournamentsfhavet
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.Thomassen✭✭0Tournamentsfhavet
Partitionning a tournament into k-strongly connected subtournaments.Thomassen✭✭0Tournamentsfhavet
Decomposing k-arc-strong tournament into k spanning strong digraphsBang-Jensen; Yeo✭✭0Tournamentsfhavet
Syndicate content