Open Problem Garden
Help
About
Contact
login/create account
Home
ยป
Coloring the Odd Distance Graph
Correction of previous comment
On November 7th, 2007 Anonymous says:
The proof is actually for
.
NR.
Reply
Are you a person?:
*
Subject:
Comment:
*
Comments are limited to a maximum of 1000 characters.
More information about formatting options
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(227)
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
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
Partition of Complete Geometric Graph into Plane Trees
Smooth 4-dimensional Poincare conjecture
Book Thickness of Subdivisions
more
login/create account
Drupal
CSI of Charles University
Correction of previous comment
The proof is actually for
.
NR.