4 views

1 Answers

In the mathematical field of graph theory, the Fritsch graph is a planar graph with 9 vertices and 21 edges.It was obtained by Fritsch as a minimal sized counterexample to the Alfred Kempe's attempt to prove the four-color theorem.

4 views

Related Questions

What is Archimedean graph?
1 Answers 5 Views
What is Heawood graph?
1 Answers 6 Views
What is Grassmann graph?
1 Answers 5 Views
What is Reeb graph?
1 Answers 4 Views
What is Diamond graph?
1 Answers 5 Views
What is Biconnected graph?
1 Answers 4 Views
What is Ladder graph?
1 Answers 4 Views
What is Half-transitive graph?
1 Answers 4 Views
What is Edge-transitive graph?
1 Answers 4 Views
What is Butterfly graph?
1 Answers 4 Views