On coloring problems of snark families (Q2840681)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6190217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On coloring problems of snark families |
scientific article; zbMATH DE number 6190217 |
Statements
23 July 2013
0 references
snark
0 references
graph coloring
0 references
total coloring
0 references
total chromatic number
0 references
vertex coloring
0 references
dot product
0 references
NP-completeness
0 references
cubic bridgeless graphs
0 references
Loupekhine family
0 references
Blanusa families
0 references
snark recognition problem
0 references
On coloring problems of snark families (English)
0 references
0.9408749938011168
0 references
0.8841672539710999
0 references
0.8532680869102478
0 references
0.8526105284690857
0 references
