scientific article
From MaRDI portal
Publication:2718334
zbMath0976.05027MaRDI QIDQ2718334
Raymond Greenlaw, Magnús M. Halldórsson, Geir Agnarsson
Publication date: 8 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (18)
A linear time algorithm to compute square of interval graphs and their colouring ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ Convex Recoloring Revisited: Complexity and Exact Algorithms ⋮ Finding clubs in graph classes ⋮ On the complexity of distance-\(d\) independent set reconfiguration ⋮ Complexity of finding graph roots with girth conditions ⋮ Distance-\(d\) independent set problems for bipartite and chordal graphs ⋮ Powers of geometric intersection graphs and dispersion algorithms ⋮ Strongly simplicial vertices of powers of trees ⋮ Labeling planar graphs with a condition at distance two ⋮ 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 ⋮ A survey on labeling graphs with a condition at distance two ⋮ On Injective Colourings of Chordal Graphs ⋮ 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
This page was built for publication:
