Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
Strong colorability
Problem Solved!
On July 24th, 2007 Anonymous says:
See "On the Strong Chromatic Number of Graphs" by Maria Axenovich and Ryan Martin (2006)
Reply
Are you a person?:
*
Subject:
Comment:
*
Comments are limited to a maximum of 1000 characters.
More information about formatting options
Navigate
Subject
Algebra
(295)
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
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more
login/create account
Drupal
CSI of Charles University
Problem Solved!
See "On the Strong Chromatic Number of Graphs" by Maria Axenovich and Ryan Martin (2006)