P____
Reputation
Top tag
Next privilege 125 Rep.
Vote down
5
Impact
~3k people reached

• 0 posts edited

Questions (4)

 4 Can a graph be non 3-colourable without having k4 as a sub graph? 2 Can a planar graph without two triangles that share an edge have a chromatic number larger than 3? 1 Planar graph with a chromatic number of 4 where all vertices have a degree of 4. 1 Is every planar graph without triangles 3-colorable?

Reputation (124)

 +5 Can a graph be non 3-colourable without having k4 as a sub graph? +5 Planar graph with a chromatic number of 4 where all vertices have a degree of 4. +10 All connected planar graph with girth at least 6 are 3-colourable +10 Rounding .5 - why isn't rounding away from zero the 'right' answer?

 5 Rounding .5 - why isn't rounding away from zero the 'right' answer? 1 All connected planar graph with girth at least 6 are 3-colourable

Tags (7)

 5 approximation 0 coloring × 4 5 fractions 0 combinatorics × 2 5 numerical-methods 0 general-topology × 2 1 graph-theory × 5

Accounts (3)

 Mathematics 124 rep 5 Stack Overflow 13 rep 2 Programming Puzzles & Code Golf 1 rep