scientific article; zbMATH DE number 1500531
From MaRDI portal
Publication:4501549
zbMATH Open0982.05050MaRDI QIDQ4501549FDOQ4501549
Authors: Ton Kloks, Richard B. Tan, J. Van Leeuwen, Hans L. Bodlaender 
Publication date: 8 April 2002
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (50)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
- The Channel Assignment Problem with Variable Weights
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- The \(L(2,1)\)-labeling on planar graphs
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- Labeling trees with a condition at distance two
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- On colored designs. III: On lambda-colored \(H\)-designs, \(H\) having \(\lambda\) edges
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Approximations for -Colorings of Graphs
- On \(L(2,1)\)-coloring split permutation graphs
- Labeling trees with a condition at distance two
- \(\lambda\)-coloring matrogenic graphs
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- On powers of graphs of bounded NLC-width (clique-width)
- Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
- Distance-two labelings of digraphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- Algorithms for graphs with small octopus
- On the universality and extremality of graphs with a distance constrained colouring
- Theory of computational complexity. Part 7. Transl. from the Russian
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- Labelling planar graphs without 4-cycles with a condition on distance two
- Distance constrained labelings of planar graphs with no short cycles
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- Facial \(L(2, 1)\)-edge-labelings of trees
- Some results on distance two labelling of outerplanar graphs
- On distance constrained labeling of disk graphs
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- A survey on labeling graphs with a condition at distance two
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Broadcasting in split graphs
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- Graph distance‐dependent labeling related to code assignment in computer networks
- A bound on the chromatic number of the square of a planar graph
- Radiocoloring in planar graphs: Complexity and approximations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Labelling of some planar graphs with a condition at distance two
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
- Labeling planar graphs with a condition at distance two
- Parameterized complexity of distance labeling and uniform channel assignment problems
- The \(L(2,1)\)-labeling of unigraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501549)
