Double-star snark
id:
double-star-snark-249-1748524
title:
Double-star snark
text:
In the mathematical field of graph theory, the double-star snark is a snark with 30 vertices and 45 edges. In 1975, Rufus Isaacs introduced two infinite families of snarks—the flower snark and the BDS snark, a family that includes the two Blanuša snarks, the Descartes snark and the Szekeres snark. Isaacs also discovered one 30-vertex snark that does not belong to the BDS family and that is not a flower snark — the double-star snark. As a snark, the double-star graph is a connected, bridgeless cu
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Double-star_snark
date created:
date modified:
2022-06-05T07:29:05Z
main entity:
{"identifier":"Q3487138","url":"https://www.wikidata.org/entity/Q3487138"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d9/Double-star_snark.svg","width":562,"height":577}
fields total:
13
integrity:
14