About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 42. Chapters: Petersen graph, Rado graph, Mobius-Kantor graph, Nauru graph, Desargues graph, Young-Fibonacci lattice, Petersen family, Herschel graph, Schlafli graph, Gray graph, Chvatal graph, Higman-Sims graph, Heawood graph, Goldner-Harary graph, Wagner graph, Durer graph, Tutte-Coxeter graph, Clebsch graph, Tutte graph, Grotzsch graph, Tutte 12-cage, Brinkmann graph, Hoffman-Singleton graph, Ljubljana graph, Shrikhande graph, Foster graph, Blanu a snarks, Ellingham-Horton graph, Pappus graph, Dyck graph, Bull graph, McGee graph, Holt graph, Tietze's graph, Frucht graph, Hall-Janko graph, F26A graph, Diamond graph, Biggs-Smith graph, Folkman graph, Butterfly graph, Harries-Wong graph, Franklin graph, Harries graph, Robertson graph, Hoffman graph, Null graph, Balaban 11-cage, Balaban 10-cage, Bidiakis cube, Errera graph, Gosset graph, Meredith graph, Double-star snark, Szekeres snark, Gewirtz graph, Watkins snark, Chang graphs, Local McLaughlin graph, Brouwer-Haemers graph. Excerpt: In the mathematical field of graph theory, the Petersen graph is an undirected graph with 10 vertices and 15 edges. It is a small graph that serves as a useful example and counterexample for many problems in graph theory. The Petersen graph is named for Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no three-edge-coloring. Although the graph is generally credited to Petersen, it had in fact first appeared 12 years earlier, in a paper by A. B. Kempe (1886). Donald Knuth states that the Petersen graph is "a remarkable configuration that serves as a counterexample to many optimistic predictions about what might be true for graphs in general." The Petersen graph is the complement of the line graph of . It is also the Kneser graph; this means that it has one vertex for each 2-element subset of a 5-element set, ...
