Distance constrained labelings of planar graphs with no short cycles (Q967308)
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: Distance constrained labelings of planar graphs with no short cycles |
scientific article; zbMATH DE number 5702581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distance constrained labelings of planar graphs with no short cycles |
scientific article; zbMATH DE number 5702581 |
Statements
Distance constrained labelings of planar graphs with no short cycles (English)
0 references
28 April 2010
0 references
\(L(p,q)\)-labeling
0 references
distance constrained labeling
0 references
planar graphs with no short cycles
0 references
0 references
0.9181119
0 references
0.9017009
0 references
0.9004923
0 references
0.89964604
0 references
0.89943254
0 references
0.8895373
0 references
0.88698053
0 references
