Blanuša snarks
id:
blanu-a-snarks-255-2021478
title:
Blanuša snarks
text:
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 hav
brand slug:
wiki
category slug:
encyclopedia
description:
Two 3-regular graphs with 18 vertices and 27 edges
original url:
https://en.wikipedia.org/wiki/Blanu%C5%A1a_snarks
date created:
date modified:
2022-06-16T03:29:26Z
main entity:
{"identifier":"Q510153","url":"https://www.wikidata.org/entity/Q510153"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/5/50/First_Blanusa_snark.svg","width":535,"height":530}
fields total:
13
integrity:
15