The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5569073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree |
scientific article; zbMATH DE number 5569073 |
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
0 references
0 references
0.8564746975898743
0 references
0.8403859734535217
0 references
0.8401750922203064
0 references
0.8358991742134094
0 references
