flower snark
infinite family of graphs
Press Enter · cited answer in seconds
0 sources
flower snark
Summary
flower snark ranks in the top 2% of general entities by monthly Wikipedia readership (14 views/month).[1]
Key Facts
- flower snark's image is recorded as Flower snarks.svg[2].
- flower is named after flower snark[3].
- flower snark's subclass of is recorded as snark[4].
- flower snark's Commons category is recorded as Flower snarks[5].
- flower snark's time of discovery or invention is recorded as +1975-00-00T00:00:00Z[6].
- flower snark's Freebase ID is recorded as /m/06zpx5j[7].
- flower snark's studied by is recorded as graph theory[8].
- flower snark's MathWorld ID is recorded as FlowerSnark[9].
- flower snark's maintained by WikiProject is recorded as WikiProject Mathematics[10].
- flower snark's introduced in is recorded as Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable[11].
Why It Matters
flower snark ranks in the top 2% of general entities by monthly Wikipedia readership (14 views/month).[1] It is known by 5 alternative names across languages and contexts.[12]