Pages that link to "Item:Q4242956"
From MaRDI portal
The following pages link to Graph labeling and radio channel assignment (Q4242956):
Displaying 33 items.
- 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)
- Radio number for trees (Q2469993) (← links)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← 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)
- \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
- A Partial Solution to Cordial Tree Conjecture (Q2831830) (← links)
- Channel assignment on Cayley graphs (Q3018071) (← links)
- IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS (Q3063610) (← links)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- Channel assignment and weighted coloring (Q4519133) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- On irreducible no-hole <i>L</i>(2, 1)-coloring of Cartesian product of trees with paths (Q4956226) (← links)
- List graphs and distance-consistent node labelings (Q5009976) (← links)
- <i>L</i>(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs (Q5097782) (← links)
- Radio Graceful Labelling of Graphs (Q5119805) (← links)
- Radio $k$-labeling of paths (Q5164256) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE (Q5217048) (← links)
- On circular-<i>L</i>(2, 1)-labellings of products of graphs (Q5259049) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Theoretical Computer Science (Q5897358) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
- The edge span of distance two labellings of graphs (Q5928417) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- Radio number for the Cartesian product of two trees (Q6184339) (← links)
- Online coloring of disk graphs (Q6634381) (← links)
- \(L(3, 2, 1)\)-labeling of certain planar graphs (Q6646440) (← links)
