Timeline for 3-coloring of specific planar graphs
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 22, 2013 at 3:40 | comment | added | Manfred Weis | edit: the solution described above is not complete: one has to remove from G all edges that are adjacent to two vertices in H and then add those edges to H. for resolving coloring-conflicts in more general graphs G, one would first identify edges in G adjacent to the same color, then duplicate the vertices adjacent to those edges and add the duplicated vertices into H; finally all edges of G that are adjacent to two vertices of H would be removed from G and inserted into H. When skip-coloring H, opaque and transparent color could be toggled if minimal (or maximal) recoloring is desired. | |
| Apr 21, 2013 at 14:58 | history | answered | Manfred Weis | CC BY-SA 3.0 |