Pages that link to "Item:Q2706187"

The following pages link to Labeling products of complete graphs with a condition at distance two (Q2706187):

Displaying 13 items.

• \(L(1,1)\)-labeling of direct product of cycles (Q2798315) (← links)
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs (Q3572431) (← links)
• On labeling the vertices of products of complete graphs with distance constraints (Q4667821) (← links)
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE (Q5016312) (← links)
• (Q5037233) (← links)
• Radio $k$-labeling of paths (Q5164256) (← links)
• Labeling trees with a condition at distance two (Q5899358) (← links)
• Injective coloring of planar graphs (Q5902135) (← links)
• Labeling trees with a condition at distance two (Q5920600) (← links)
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph (Q5963629) (← links)
• (Q6184161) (← links)
• A different approach for multi-level distance labellings of path structure networks (Q6544864) (← links)