Publication details
Distance constrained labelings of K-4-minor free graphs
| Authors | |
|---|---|
| Year of publication | 2009 |
| Type | Article in Periodical |
| Magazine / Source | Discrete Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1016/j.disc.2008.05.022 |
| Keywords | K-4-minor free graph; Series-parallel graph; Distance constrained labeling |
| Description | Motivated by previous results on distance constrained labelings and coloring of squares of K-4-minor free graphs, we show that for every p >= q >= 1 there exists Delta(0) such that every K-4-minor free graph G with maximum degree Delta >= Delta(0) has an L(p, q)-labeling of span at most qleft perpendicular3 Delta(G)/2right perpendicular. The obtained bound is the best possible. (C) 2008 Elsevier B.V. All rights reserved. |