114 reputation
5
bio website
location
age
visits member for 1 year, 9 months
seen Mar 31 at 5:35

Nov
22
revised All connected planar graph with girth at least 6 are 3-colourable
added 218 characters in body
Nov
22
accepted Planar graph with a chromatic number of 4 where all vertices have a degree of 4.
Nov
22
awarded  Editor
Nov
22
revised All connected planar graph with girth at least 6 are 3-colourable
added 84 characters in body
Nov
22
answered All connected planar graph with girth at least 6 are 3-colourable
Nov
22
asked Planar graph with a chromatic number of 4 where all vertices have a degree of 4.
Nov
19
comment Can a planar graph without two triangles that share an edge have a chromatic number larger than 3?
Huh, I could have swore I eyeballed a 3-coloring to it. Is there any chance you could point me to further reading on Bordeaux's conjecture?
Nov
19
accepted Can a planar graph without two triangles that share an edge have a chromatic number larger than 3?
Nov
19
comment Can a planar graph without two triangles that share an edge have a chromatic number larger than 3?
Thank you very much for your reply, but of what relevance is that graph?
Nov
18
accepted Can a graph be non 3-colourable without having k4 as a sub graph?
Nov
18
awarded  Teacher
Nov
18
answered Rounding .5 - why isn't rounding away from zero the 'right' answer?
Nov
18
accepted Is every planar graph without triangles 3-colorable?
Nov
18
awarded  Supporter
Nov
18
asked Can a planar graph without two triangles that share an edge have a chromatic number larger than 3?
Nov
5
awarded  Scholar
Nov
1
asked Is every planar graph without triangles 3-colorable?
Oct
31
awarded  Student
Oct
31
asked Can a graph be non 3-colourable without having k4 as a sub graph?