Graph TheorySuperchallengePlanar Graphs SharePlanar Graphs · Superchallenge problemCan a planar graph have every single vertex of degree exactly 666?ANo: then E=3V>3V−6E=3V>3V-6E=3V>3V−6BYes, the triangular latticeCYes, if V≥12V\ge 12V≥12DOnly if it is disconnectedCheck Show answer Walk through it step by step Practice more like this Review this concept