The Kuratowski’s theorem is based on the concept of the –planner graph. So the Planar Graphs are of incredible significance in chart hypothesis. A planar chart is a graph which can be attracted the plane with no edges crossing. A few photos of a Planar Graph may have “crossing edges” be that as it may; it's conceivable to redraw the photo to take out the intersections.
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27 | 28 | 29 | 30 | 1 | 2 | 3 |
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |