Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:13, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity of two coloring problems in cubic planar bipartite mixed graphs |
scientific article |
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