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):

Displaying 22 items.

• A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
• \(L(3,2,1)\)-labeling of triangular and toroidal grids (Q301947) (← links)
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
• Generic algorithms for some decision problems on fasciagraphs and rotagraphs (Q442402) (← links)
• The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
• The \(k\)-distance independence number and 2-distance chromatic number of Cartesian products of cycles (Q723608) (← links)
• 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 strong products of cycles (Q1041747) (← links)
• \((d, n)\)-packing colorings of infinite lattices (Q1701099) (← links)
• \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
• On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
• \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
• Labeling crossed prisms with a condition at distance two (Q2398942) (← 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)
• On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs (Q2662888) (← links)
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
• \(L(2,1)\)-labeling for brick product graphs (Q5963632) (← links)