The following pages link to (Q4501549):
Displaying 42 items.
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
- The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
- Distance-two labelings of digraphs (Q881579) (← links)
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q930929) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On colored designs. III: On lambda-colored \(H\)-designs, \(H\) having \(\lambda\) edges (Q1598789) (← links)
- Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← links)
- Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794) (← links)
- The \(L(2,1)\)-labeling of unigraphs (Q2275923) (← links)
- \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
- On powers of graphs of bounded NLC-width (clique-width) (Q2383546) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction (Q2420428) (← links)
- Labelling of some planar graphs with a condition at distance two (Q2454996) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs (Q2463926) (← links)
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem (Q2472818) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs (Q3439105) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- Graph distance‐dependent labeling related to code assignment in computer networks (Q4667824) (← links)
- (Q4691779) (← links)
- (Q4947488) (← links)
- (Q5037233) (← links)
- Labeling trees with a condition at distance two (Q5899358) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
