Labeling planar graphs with a condition at distance two
- 1 November 2007
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 28 (8) , 2201-2239
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A bound on the chromatic number of the square of a planar graphJournal of Combinatorial Theory, Series B, 2005
- An exact algorithm for the channel assignment problemDiscrete Applied Mathematics, 2005
- On the span in channel assignment problems: bounds, computing and countingDiscrete Mathematics, 2003
- A Theorem about the Channel Assignment ProblemSIAM Journal on Discrete Mathematics, 2003
- Coloring the square of a planar graphJournal of Graph Theory, 2002
- Fixed-parameter complexity of λ-labelingsDiscrete Applied Mathematics, 2001
- On L(d,1)-labelings of graphsDiscrete Mathematics, 2000
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- Labeling Chordal Graphs: Distance Two ConditionSIAM Journal on Discrete Mathematics, 1994
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992