Partitioning a graph into a cycle and an anticycle Joint work with St\'ephan Bessy

Stephan Thomasse
Université des Sciences et Techniques de Languedoc (USTL) (Montpellier II)

Answering a question of Lehel, we prove that if the edges of the complete graph are colored in blue and red, one can find a vertex-partition into a red cycle and a blue cycle.

Back to Workshop III: Topics in Graphs and Hypergraphs