scientific article; zbMATH DE number 1500531
From MaRDI portal
Publication:4501549
Recommendations
Cited in
(50)- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- Some results on distance two labelling of outerplanar graphs
- -backbone colorings along pairwise disjoint stars and matchings
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Algorithms for graphs with small octopus
- On colored designs. III: On lambda-colored \(H\)-designs, \(H\) having \(\lambda\) edges
- Spectrum graph coloring and applications to Wi-Fi channel assignment
- Facial \(L(2, 1)\)-edge-labelings of trees
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- Theory of computational complexity. Part 7. Transl. from the Russian
- The \(L(2,1)\)-labeling of unigraphs
- L(p,q) labeling of d-dimensional grids
- On powers of graphs of bounded NLC-width (clique-width)
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
- Labelling of some planar graphs with a condition at distance two
- Labeling planar graphs with a condition at distance two
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- A bound on the chromatic number of the square of a planar graph
- A survey on labeling graphs with a condition at distance two
- Radiocoloring in planar graphs: Complexity and approximations
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- On the universality and extremality of graphs with a distance constrained colouring
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- On \(\lambda \)-coloring split, chordal bipartite and weakly chordal graphs
- On L(2,1)-coloring split permutation graphs
- Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
- Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- Approximations for -Colorings of Graphs
- Graph distance‐dependent labeling related to code assignment in computer networks
- scientific article; zbMATH DE number 6963895 (Why is no real title available?)
- scientific article; zbMATH DE number 1433954 (Why is no real title available?)
- More relations between -labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
- The Channel Assignment Problem with Variable Weights
- Labeling trees with a condition at distance two
- Labeling trees with a condition at distance two
- Broadcasting in split graphs
- L(2,1)-labeling of perfect elimination bipartite graphs
- On distance constrained labeling of disk graphs
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- \(\lambda\)-coloring matrogenic graphs
- The \(L(2,1)\)-labeling on planar graphs
- Distance-two labelings of digraphs
- Improved upper bounds on the L(2,1)-labeling of the skew and converse skew product graphs
- Labelling planar graphs without 4-cycles with a condition on distance two
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- Distance constrained labelings of planar graphs with no short cycles
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
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)
