Graph labeling and radio channel assignment
From MaRDI portal
Publication:4242956
Recommendations
Cited in
(86)- L(p,2,1)-labeling of the infinite regular trees
- Radio number for trees
- Locally injective k-colourings of planar graphs
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- Path covering number and \(L(2,1)\)-labeling number of graphs
- 0-1 labelling for network characterization
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- List backbone colouring of graphs
- Labeling trees with a condition at distance two
- Graph labellings with variable weights, a survey
- Arrangements, channel assignments, and associated polynomials
- Algorithmic expedients for the \(S\)-labeling problem
- Labeling bipartite permutation graphs with a condition at distance two
- A note on \(L (2, 1)\)-labelling of trees
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- L(1, 2)-edge-labelings for lattices
- Distance-constrained labellings of Cartesian products of graphs
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- A note on collections of graphs with non-surjective lambda labelings
- On a distance-constrained graph labeling to model cooperation
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Extremal problems on consecutive \(L(2,1)\)-labelling
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
- An extremal problem on non-full colorable graphs
- Distance two labeling on the square of a cycle
- The edge span of distance two labellings of graphs
- L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
- L(3,2,1)-labeling of triangular and toroidal grids
- Distributive online channel assignment for hexagonal cellular networks with constraints
- Channel assignment and weighted coloring
- Worst-case analysis of a dynamic channel assignment strategy
- Radio channel assignment on 2-dimensional lattices
- Distance-two labelings of digraphs
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints
- List graphs and distance-consistent node labelings
- Channel assignment on Cayley graphs
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Radio fuzzy graphs and assignment of frequency in radio stations
- On L(2,1)-labelings of Cartesian products of paths and cycles
- Linear and cyclic distance-three labellings of trees
- Radio number for the Cartesian product of two trees
- On Hamiltonian colorings for some graphs
- Radio mean labeling of a graph
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
- \(L(2,1)\)-labeling of direct product of paths and cycles
- A distance-labelling problem for hypercubes
- Radio Graceful Labelling of Graphs
- Distance-two labellings of Hamming graphs
- Combinatorial optimization in system configuration design
- Online coloring of disk graphs
- Generalized list \(T\)-colorings of cycles
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
- Frequency assignment problem in networks with limited spectrum
- Distance-two labelings of graphs
- Distance two edge labelings of lattices
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
- On Hamiltonian colorings of graphs
- Optimal radio labellings of complete m-ary trees
- On distance constrained labeling of disk graphs
- Improper coloring of weighted grid and hexagonal graphs
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- A doubly cyclic channel assignment problem
- A Partial Solution to Cordial Tree Conjecture
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- \(L(3, 2, 1)\)-labeling of certain planar graphs
- A survey on labeling graphs with a condition at distance two
- Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
- Multiple \(L(j,1)\)-labeling of the triangular lattice
- On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Cyclic labellings with constraints at two distances
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- Price of anarchy for graph coloring games with concave payoff
- Exact solution of a class of frequency assignment problems in cellular networks (extended abstract)
- Real Number Channel Assignments for Lattices
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures
- A bound on the chromatic number of the square of a planar graph
- On circular-L(2, 1)-labellings of products of graphs
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle
- Backbone coloring for graphs with large girths
- Systems of distant representatives
- On the computational complexity of partial covers of theta graphs
- Utility and expandability of channel assignments.
- Radio \(k\)-labeling of paths
This page was built for publication: Graph labeling and radio channel assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242956)
