The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree |
scientific article |
Statements
The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (English)
0 references
23 June 2009
0 references
\(L(p, q)\)-labeling
0 references
graphs of small degree
0 references
bipartite graphs
0 references
planar graphs
0 references
