snark
connected, bridgeless cubic graph with chromatic index equal to 4
Facts
5 properties- Instance of
- mathematical concept
- Subclass of
- connected graph, cubic graph, bridgeless graph[3][4][5]
- Has characteristic
- edge chromatic number[6]
- Studied by
- graph theory[7]
🏷️ Also known as
en snark
de Snark (Graphentheorie)
es Snark (teoría de grafos)
he סנרק
ja スナーク (グラフ理論)
ja スナークグラフ
pl Żmirłacz (teoria grafów)
ru снарк
ru снарк (теория графов)
zh Snark猜想
🔖 Identifiers · 4
- FOLDOC ID
- snark
- Freebase ID
- /m/03644m
- MathWorld ID
- Snark
- Wolfram Language entity code
- Entity["GraphClass", "Snark"]
🔗 Connections
Examples 4
Subclass of 2
Created notable works 1
Maintained by WikiProject 1
Studied by 1
Subtypes 1
Press Enter · cited answer in seconds
0 sources
Summary
snark is a mathematical concept[1].