Graph labeling and radio channel assignment
From MaRDI portal
Publication:4242956
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V" /><263::AID-JGT5>3.0.CO;2-V 10.1002/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-VzbMath0930.05087OpenAlexW4245476487MaRDI QIDQ4242956
M. A. Shepherd, Jan van den Heuvel, R. A. Leese
Publication date: 9 February 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199812)29:4<263::aid-jgt5>3.0.co;2-v
Related Items (74)
Extremal problems on consecutive \(L(2,1)\)-labelling ⋮ Distributive online channel assignment for hexagonal cellular networks with constraints ⋮ \(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ Radio mean labeling of a graph ⋮ An extremal problem on non-full colorable graphs ⋮ Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups ⋮ A doubly cyclic channel assignment problem ⋮ Distance-two labelings of digraphs ⋮ Backbone coloring for graphs with large girths ⋮ \(L(p,2,1)\)-labeling of the infinite regular trees ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ Radio number for the Cartesian product of two trees ⋮ List backbone colouring of graphs ⋮ Distance two edge labelings of lattices ⋮ Circular \(L(j,k)\)-labeling number of direct product of path and cycle ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice ⋮ Arrangements, channel assignments, and associated polynomials ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ The minimum span of \(L(2,1)\)-labelings of generalized flowers ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ Price of anarchy for graph coloring games with concave payoff ⋮ Radio number for trees ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ Channel assignment on Cayley graphs ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs ⋮ Radio $k$-labeling of paths ⋮ New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ On the computational complexity of partial covers of theta graphs ⋮ Algorithmic expedients for the \(S\)-labeling problem ⋮ Graph labellings with variable weights, a survey ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ A bound on the chromatic number of the square of a planar graph ⋮ Systems of distant representatives ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs ⋮ On distance constrained labeling of disk graphs ⋮ On Hamiltonian colorings of graphs ⋮ Multiple \(L(j,1)\)-labeling of the triangular lattice ⋮ Generalized list \(T\)-colorings of cycles ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ Channel assignment and weighted coloring ⋮ Polyhedral studies for minimum‐span graph labelling with integer distance constraints ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ Frequency assignment problem in networks with limited spectrum ⋮ IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS ⋮ On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ A distance-labelling problem for hypercubes ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ On Hamiltonian colorings for some graphs ⋮ Linear and cyclic distance-three labellings of trees ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE ⋮ Labeling trees with a condition at distance two ⋮ Labeling bipartite permutation graphs with a condition at distance two ⋮ Distance-two labellings of Hamming graphs ⋮ Combinatorial optimization in system configuration design ⋮ A Partial Solution to Cordial Tree Conjecture ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Worst-case analysis of a dynamic channel assignment strategy ⋮ Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures ⋮ \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings ⋮ List graphs and distance-consistent node labelings ⋮ On circular-L(2, 1)-labellings of products of graphs ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey ⋮ Distance-two labelings of graphs
This page was built for publication: Graph labeling and radio channel assignment
