Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180)
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 two coloring problems in cubic planar bipartite mixed graphs |
scientific article; zbMATH DE number 5703762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of two coloring problems in cubic planar bipartite mixed graphs |
scientific article; zbMATH DE number 5703762 |
Statements
Complexity of two coloring problems in cubic planar bipartite mixed graphs (English)
0 references
5 May 2010
0 references
mixed graph coloring
0 references
computational complexity
0 references
list coloring
0 references
bipartite graph
0 references
scheduling
0 references
0 references
0 references
0.9001231
0 references
0.8985021
0 references
0 references
0.8940987
0 references
0.89340204
0 references
0.88670045
0 references
