Testing whether or not a graph is planar is an important aspect of graph theory. Wagner’s Theorem provides a characterization of planar graphs based on graph minors. 512 more words
Tags » Planar Graphs
- Does the class of constant-degree expanders have polynomially-long induced paths?
- Planar embedding conjecture — Can every planar graph equipped with an arbitrary shortest-path metric be embedded into L1 with only a constant distortion? 65 more words
This is the introductory note of a sequence of notes dedicated to Euler-Poincaré characteristic. Here, we deal with Euler’s formula from a graph theoritical viewpoint and exhibit several applications including a proof of Pick’s theorem and the classification of Plato’s solids. 1,157 more words