Pages that link to "Item:Q4242956"
From MaRDI portal
The following pages link to Graph labeling and radio channel assignment (Q4242956):
Displayed 50 items.
- \(L(3,2,1)\)-labeling of triangular and toroidal grids (Q301947) (← links)
- Radio mean labeling of a graph (Q322022) (← links)
- Backbone coloring for graphs with large girths (Q385734) (← links)
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
- Linear and cyclic distance-three labellings of trees (Q741540) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Distance-two labelings of digraphs (Q881579) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- On Hamiltonian colorings for some graphs (Q1005245) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- A doubly cyclic channel assignment problem (Q1382286) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
- Systems of distant representatives (Q1764814) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- A note on collections of graphs with non-surjective lambda labelings (Q1765378) (← links)
- On Hamiltonian colorings of graphs (Q1772412) (← links)
- Generalized list \(T\)-colorings of cycles (Q1775057) (← links)
- Frequency assignment problem in networks with limited spectrum (Q1788938) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Worst-case analysis of a dynamic channel assignment strategy (Q1827841) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- Distributive online channel assignment for hexagonal cellular networks with constraints (Q1887044) (← links)
- Distance two edge labelings of lattices (Q1956249) (← links)
- Arrangements, channel assignments, and associated polynomials (Q1961908) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
- Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures (Q2079984) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice (Q2343988) (← links)
- Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
- An extremal problem on non-full colorable graphs (Q2384400) (← links)
- List backbone colouring of graphs (Q2440098) (← links)
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice (Q2445232) (← links)
- Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)