Pages that link to "Item:Q1406039"

The following pages link to Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039):

Displayed 8 items.

• Distance-two labelings of digraphs (Q881579) ‎ (← links)
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) ‎ (← links)
• \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) ‎ (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) ‎ (← 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)
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles (Q2576352) ‎ (← links)