Concepedia

Publication | Open Access

Every generalized Petersen graph has a Tait coloring

90

Citations

25

References

1972

Year

Abstract

Watkins has defined a family of graphs which he calls generalized Petersen graphs. He conjectures that all but the original Petersen graph have a Tait coloring, and proves the conjecture for a large number of these graphs. In this paper it is shown that the conjecture is indeed true.

References

YearCitations

Page 1