The following pages link to (Q4242956):
Displayed 31 items.
- On distance constrained labeling of disk graphs (Q703553) (← links)
- No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397) (← links)
- Distance-two labelings of digraphs (Q881579) (← 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)
- 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)
- 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)
- 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)
- Arrangements, channel assignments, and associated polynomials (Q1961908) (← links)
- Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
- An extremal problem on non-full colorable graphs (Q2384400) (← 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)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- (Q4519133) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)