All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Ten Colors (Posted on 2004-03-05) Difficulty: 3 of 5
Albinia consists of two states: Alexton and Brighton. Each road in Albinia connects two towns from Alexton and Brighton respectively. It is known that no town is connected with more than 10 others.

Prove that it is possible to color all roads in Albinia, using 10 colors, in such a way that no two adjacent roads would be the same color (we call two roads adjacent if they leave the same town).

No Solution Yet Submitted by Aaron    
Rating: 4.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsNo SubjectIain2004-03-22 16:23:29
ReferencesRichard2004-03-05 19:05:46
Some ThoughtsloopholeTristan2004-03-05 17:28:12
Some Thoughts10 x 10 -- A StartRichard2004-03-05 13:26:18
QuestionQuestion for AaronPenny2004-03-05 11:18:44
Some ThoughtsHarder than it looks at first sight.Charlie2004-03-05 09:41:46
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information