Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Neumann-Lara, Victor
Graph Theory
»
Directed Graphs
The Two Color Conjecture
★★
Author(s):
Neumann-Lara
Conjecture
If
is an orientation of a simple planar graph, then there is a partition of
into
so that the graph induced by
is acyclic for
.
Keywords:
acyclic
;
digraph
;
planar
Posted by
mdevos
updated May 31st, 2007
1 comment
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
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
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more