Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

SIAMDM
2008

favoriteEmaildiscussreport

140views more SIAMDM 2008»

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

13 years 4 months ago

Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice

Download atrey.karlin.mff.cuni.cz

We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infinite triangular plane lattice (solving an open problem of Griggs). Key words. real number graph labelling, channel assignment problem, graph labelling with distance conditions AMS subject classifications. 05C15

Daniel Král, Petr Skoda

Real-time Traffic

Graph Labelling Problem | Labelling | Real Number Graph | SIAMDM 2008 |

claim paper

Related Content

» Optimal Channel Assignments for Lattices with Conditions at Distance Two

» Real Number Channel Assignments for Lattices

» The Parameterized Complexity of Some Minimum Label Problems

» Fast Computation of Reachability Labeling for Large Graphs

» Recent progress in mathematics and engineering on optimal graph labellings with distance c...

» Labeling Schemes for Tree Representation

» Compact Ancestry Labeling Schemes for XML Trees

» Mining Frequent Subgraph by Incidence Matrix Normalization

» Fast Periodic Graph Exploration with Constant Memory

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SIAMDM
Authors	Daniel Král, Petr Skoda

Comments (0)