Pages that link to "Item:Q5937459"
From MaRDI portal
The following pages link to Hamiltonicity and circular distance two labellings (Q5937459):
Displaying 22 items.
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← 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)
- Distance-two labelings of digraphs (Q881579) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- Distance two edge labelings of lattices (Q1956249) (← links)
- Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
- Radio number for trees (Q2469993) (← links)
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← 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)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- <i>L</i>(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs (Q5097782) (← links)
- On circular-<i>L</i>(2, 1)-labellings of products of graphs (Q5259049) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630) (← links)
- \(L(j,k)\)-labeling number of Cartesian product of path and cycle (Q5963640) (← links)
