Publication:2718334
From MaRDI portal
zbMath0976.05027MaRDI QIDQ2718334
Raymond Greenlaw, Magnús M. Halldórsson, Geir Agnarsson
Publication date: 8 January 2002
Related Items
Convex Recoloring Revisited: Complexity and Exact Algorithms, On Injective Colourings of Chordal Graphs, Finding clubs in graph classes, The square of a block graph, Distance constrained labelings of planar graphs with no short cycles, Graph labellings with variable weights, a survey, Chromatic sets of power graphs and their application to resource placement in multicomputer networks, The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree, Distance constrained labelings of \(K_{4}\)-minor free graphs, Powers of geometric intersection graphs and dispersion algorithms, Complexity of finding graph roots with girth conditions, Distance-\(d\) independent set problems for bipartite and chordal graphs, Strongly simplicial vertices of powers of trees, Labeling planar graphs with a condition at distance two, A survey on labeling graphs with a condition at distance two