Flower snark
id:
flower-snark-166-6940167
title:
Flower snark
text:
In the mathematical field of graph theory, the flower snarks form an infinite family of snarks introduced by Rufus Isaacs in 1975. As snarks, the flower snarks are connected, bridgeless cubic graphs with chromatic index equal to 4. The flower snarks are non-planar and non-Hamiltonian. The flower snarks J5 and J7 have book thickness 3 and queue number 2.
brand slug:
wiki
category slug:
encyclopedia
description:
Infinite family of graphs
original url:
https://en.wikipedia.org/wiki/Flower_snark
date created:
2009-07-27T08:01:31Z
date modified:
2024-08-29T20:56:21Z
main entity:
{"identifier":"Q5462247","url":"https://www.wikidata.org/entity/Q5462247"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/6/6a/Flower_snarks.svg","width":1118,"height":1031}
fields total:
13
integrity:
16