|
GraphTheory[SpecialGraphs][SzekeresSnark]
GraphTheory[SpecialGraphs][DoubleStarSnark]
|
|
Calling Sequence
|
|
SzekeresSnark()
DoubleStarSnark()
|
|
|
Description
|
|
|
•
|
A snark is a nontrivial cubic graph with chromatic index 4.
|
|
•
|
The SzekeresSnark command creates a snark with 50 vertices.
|
|
•
|
The DoubleStarSnark command creates a snark with 30 vertices.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
|
Download Help Document
Was this information helpful?
