Home » Author index

Neumann-Lara, Victor


Graph Theory » Directed Graphs

The Two Color Conjecture ★★

Author(s): Neumann-Lara

Conjecture   If $ G $ is an orientation of a simple planar graph, then there is a partition of $ V(G) $ into $ \{X_1,X_2\} $ so that the graph induced by $ X_i $ is acyclic for $ i=1,2 $.

Keywords: acyclic; digraph; planar

Posted by mdevos
updated May 31st, 2007
1 comment
Syndicate content