The following pages link to (Q4949819):
Displaying 26 items.
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
- New \(L(j,k)\)-labelings for direct products of complete graphs (Q514706) (← links)
- Distance two labelling and direct products of graphs (Q932631) (← 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)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- Radio number for the product of a path and a complete graph (Q2352358) (← links)
- \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
- Labelling of some planar graphs with a condition at distance two (Q2454996) (← links)
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- Labeling products of complete graphs with a condition at distance two (Q2706187) (← links)
- \(L(j,k)\)-labelings of Cartesian products of three complete graphs. (Q2804784) (← links)
- Product Nordhaus-Gaddum-type results for the induced path number involving complements with respect to \(K_n\) or \(K_{n,n}\) (Q2878220) (← links)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- Labeling trees with a condition at distance two (Q5899358) (← links)
- Labeling trees with a condition at distance two (Q5920600) (← links)
