GraphTheory[SpecialGraphs][FlowerSnark]
GraphTheory[SpecialGraphs][GoldbergSnark]
|
Calling Sequence
|
|
FlowerSnark(K)
GoldbergSnark(K)
|
|
Description
|
|
•
|
A snark is a nontrivial cubic graph with chromatic index 4.
|
•
|
The FlowerSnark command creates the flower snark graphs, also known as Isaac's snarks. A flower snark with parameter K, is a 3-regular graph on 4*K vertices. The GoldbergSnark(K) command creates the Goldberg snark with parameter K. A Goldberg snark with parameter K, is a 3-regular graph on 8*K vertices.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
| (1) |
>
|
|
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
|
|
Download Help Document
Was this information helpful?