One representation of these objects is called the Fary embedding, and these objects also satisfy the MacLane and Schnyder criteria. Hopcroft and Tarjan formulated an efficient algorithm for checking for these objects, while another way of testing for
One representation of these objects is called the Fary embedding, and these objects also satisfy the MacLane and Schnyder criteria. Hopcroft and Tarjan formulated an efficient algorithm for checking for these objects, while another way of testing for them uses the Fraysseix-Rosenstiehl left-right algorithm. The Steinitz theorem couples them to a polyhedral representation, while the Whitney criterion states that their set must be closed under the matroid duality. According to Barnett's conjecture, every bipartite cubic one of these is Hamiltonian, and one of these must not contain either K-sub-5 or K-sub-3,3 as a minor, a result known as Kuratowski's theorem. For 10 points, identify these mathematical objects, which consist of vertices and edges that can be drawn on a flat surface.
One representation of these objects is called the Fary embedding, and these objects also satisfy the MacLane and Schnyder criteria.
planar graphs