{"version":"1.0","type":"link","title":"Kittell graph - Newikis","description":"In the mathematical field of graph theory, the Kittell graph is a planar graph with 23 vertices and 63 edges. Its unique planar embedding has 42 triangular faces. The Kittell graph is named after Irving Kittell, who used it as a counterexample to Alfred Kempe's flawed proof of the four-color…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/a/a8/Kittell_graph.svg/1280px-Kittell_graph.svg.png","thumbnail_width":1280,"thumbnail_height":1003}