Blanuša snarks
In the mathematical field of graph theory, the Blanuša snarks are two 3-regular graphs with 18 vertices and 27 edges. They were discovered by Yugoslavian mathematician Danilo Blanuša in 1946 and are named after him. When discovered, only one snark was known—the Petersen graph. As snarks, the Blanuša snarks are connected, bridgeless cubic graphs with chromatic index equal to 4. Both of them have chromatic number 3, diameter 4 and girth 5. They are non-hamiltonian but are hypohamiltonian. Both have book thickness 3 and queue number 2.
Wikipage redirect
primaryTopic
Blanuša snarks
In the mathematical field of graph theory, the Blanuša snarks are two 3-regular graphs with 18 vertices and 27 edges. They were discovered by Yugoslavian mathematician Danilo Blanuša in 1946 and are named after him. When discovered, only one snark was known—the Petersen graph. As snarks, the Blanuša snarks are connected, bridgeless cubic graphs with chromatic index equal to 4. Both of them have chromatic number 3, diameter 4 and girth 5. They are non-hamiltonian but are hypohamiltonian. Both have book thickness 3 and queue number 2.
has abstract
In the mathematical field of g ...... hickness 3 and queue number 2.
@en
Снарк Блануши — 3-регулярный г ...... льтоновы, но гипогамильтоновы.
@ru
Снарк Блануші — 3-регулярний г ...... 5. Вони негамільтонові, але .
@uk
Wikipage page ID
24,054,041
page length (characters) of wiki page
Wikipage revision ID
872,994,060
Link from a Wikipage to another Wikipage
book thickness
chromatic index
chromatic number
image caption
The first Blanuša snark
@en
name
Blanuša snarks
@en
namesake
queue number
vertices
wikiPageUsesTemplate
hypernym
comment
In the mathematical field of g ...... hickness 3 and queue number 2.
@en
Снарк Блануши — 3-регулярный г ...... льтоновы, но гипогамильтоновы.
@ru
Снарк Блануші — 3-регулярний г ...... 5. Вони негамільтонові, але .
@uk
label
Blanuša snarks
@en
Снарк Блануши
@ru
Снарк Блануші
@uk