Timeline for Are all Hamiltonian planar graphs are 4 colorable? Does this imply all planar graphs are colorable?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 1, 2016 at 13:15 | comment | added | David E Speyer | Consider the bipyramid: Take two tetrahedra and glue them face to face. The result is a planar graph with five vertices, six triangular faces and, also a $3$-cycle which is not a face. | |
| May 1, 2016 at 2:48 | comment | added | Turbo | what do you mean by no 3-cycles which are not faces? Aren't all 3-cycles in a planar graph faces? | |
| Aug 17, 2010 at 1:57 | vote | accept | robert carlson | ||
| Aug 17, 2010 at 1:56 | vote | accept | robert carlson | ||
| Aug 17, 2010 at 1:57 | |||||
| Aug 17, 2010 at 1:43 | vote | accept | robert carlson | ||
| Aug 17, 2010 at 1:56 | |||||
| Aug 17, 2010 at 1:41 | vote | accept | robert carlson | ||
| Aug 17, 2010 at 1:43 | |||||
| Aug 16, 2010 at 18:36 | history | edited | David E Speyer | CC BY-SA 2.5 |
added 188 characters in body
|
| Aug 16, 2010 at 18:08 | history | answered | David E Speyer | CC BY-SA 2.5 |