scientific article; zbMATH DE number 1500531
From MaRDI portal
Publication:4501549
zbMath0982.05050MaRDI QIDQ4501549
Jan van Leeuwen, Ton Kloks, Richard B. Tan, Hans L. Bodlaender
Publication date: 8 April 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
\(L(p,q)\) labeling of \(d\)-dimensional grids, Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies, On powers of graphs of bounded NLC-width (clique-width), On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations, Unnamed Item, \(\lambda\)-coloring matrogenic graphs, Spectrum graph coloring and applications to Wi-Fi channel assignment, The \(L(2,1)\)-labeling on planar graphs, Facial \(L(2, 1)\)-edge-labelings of trees, Distance-two labelings of digraphs, Parameterized complexity of distance labeling and uniform channel assignment problems, Broadcasting in split graphs, Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction, \(L(2,1)\)-labeling of perfect elimination bipartite graphs, Algorithms for graphs with small octopus, Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs, Labelling of some planar graphs with a condition at distance two, Unnamed Item, Labeling planar graphs with a condition at distance two, The \(L(2,1)\)-labeling on the skew and converse skew products of graphs, Labelling planar graphs without 4-cycles with a condition on distance two, The \(L(2,1)\)-labeling on Cartesian sum of graphs, The \(L(2,1)\)-labeling on graphs and the frequency assignment problem, Distance constrained labelings of planar graphs with no short cycles, A bound on the chromatic number of the square of a planar graph, On distance constrained labeling of disk graphs, Graph distance‐dependent labeling related to code assignment in computer networks, A survey on labeling graphs with a condition at distance two, \(L(2,1)\)-labelings on the composition of \(n\) graphs, The \(L(2,1)\)-labeling of unigraphs, Theory of computational complexity. Part 7. Transl. from the Russian, Labeling trees with a condition at distance two, The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications, Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems, Labeling trees with a condition at distance two, Some results on distance two labelling of outerplanar graphs, \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings, Distance constrained labelings of \(K_{4}\)-minor free graphs, Radiocoloring in planar graphs: Complexity and approximations, Systems of pairs of \(q\)-distant representatives, and graph colorings, Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
