Title of article
Distance Constrained Labelings of -minor Free Graphs
Author/Authors
Krلlʹ، نويسنده , , Daniel and Nejedl، نويسنده , , Pavel، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
8
From page
549
To page
556
Abstract
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 Δ 0 such that every K 4 -minor free graph G with maximum degree Δ ⩾ Δ 0 has an L ( p , q ) -labeling of span at most q ⌊ 3 Δ / 2 ⌋ . The obtained bound is the best possible.
Keywords
series-parallel graphs , K 4 -minor free graphs , L ( p , q ) -labelings
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454643
Link To Document