Challenge

Build Snarks

Four trivalent graphs with chromatic index of 4
Four trivalent graphs with chromatic index of 4

Build connected networks and graphs with only 3-way connectors.

  • What is the chromatic index of a connected network or graph? What is Vizing's Theorem?
  • What are trivalent graphs and snarks? What is the smallest snark?
  • Who is Martin Gardner and why did he name these graphs "Snarks"?
  • What are weak snarks and strong snarks? What is the girth of a cyclic graph?
  • How many snarks have 18, 20 or N vertices?
  • What do snarks and fullerenes have in common?
  • How can the properties of snarks be used for practical purposes?

For answers, notes, and supporting materials, enter your license code.

Enter Premium License

Pinned images from our dedicated Pinterest board.