Complexity of the oriented coloring in planar, cubic oriented graphs (Q6489463)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of the oriented coloring in planar, cubic oriented graphs |
scientific article; zbMATH DE number 7835257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the oriented coloring in planar, cubic oriented graphs |
scientific article; zbMATH DE number 7835257 |
Statements
Complexity of the oriented coloring in planar, cubic oriented graphs (English)
0 references
22 April 2024
0 references
oriented coloring
0 references
cubic graph
0 references
planar graph
0 references
NP-complete
0 references
0.9005202651023865
0 references
0.8382662534713745
0 references
0.8277009129524231
0 references
0.8237653970718384
0 references
