-labelling of -minor free graphs☆
References (13)
Topology of series-parallel networks
J. Math. Anal. Appl.
(1965)- et al.
Coloring the square of -minor free graph
Discrete Math.
(2003) - et al.
A bound on the chromatic number of the square of a planar graph
J. Combin. Theory Ser. B
(2005) - et al.
The -labeling problem on graphs
SIAM J. Discrete Math.
(1996) On the -labelling of graphs
- et al.
Labelling graphs with a condition at distance 2
SIAM J. Discrete Math.
(1992)
There are more references available in the full text version of this article.
Cited by (4)
Distance constrained labelings of K<inf>4</inf>-minor free graphs
2009, Discrete MathematicsDistance Constrained Labelings of K<inf>4</inf>-minor Free Graphs
2007, Electronic Notes in Discrete MathematicsOn coloring problems
2013, Handbook of Combinatorial OptimizationThe L(h, k)-labelling problem: An updated survey and annotated bibliography
2011, Computer Journal
- ☆
Research supported partially by NSFC (No. 10471131) and ZJNSF (No. M103094, Y604167).
Copyright © 2006 Elsevier B.V. All rights reserved.