Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2009.10.016 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2009.10.016 / rank | |||
Normal rank | |||
Latest revision as of 10:25, 10 December 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
