Talk:Five Color Theorem

I'm working on it... First, I have to build up some other graph theory proofs. -Dan

Is there a simple proof that two colors suffice for painting segments on a line? This is a one-dimension counterpart to the four color theorem -Matfan

Good question - care to craft one? --prime mover (talk) 22:22, 24 March 2009 (UTC)

Motivation for the recent edit:

• induced subgraph implies that the edges between vertices are preserved. No need to specify.
• although walk is acceptable here, path is more strict (and more in spirit with common proofs of this theorem)

--Stixme (talk) 09:57, 23 January 2018 (EST)