Pages that link to "Item:Q2902894"
From MaRDI portal
The following pages link to Griggs and Yeh's Conjecture and $L(p,1)$-labelings (Q2902894):
Displaying 20 items.
- The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
- Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539) (← links)
- Linear and cyclic distance-three labellings of trees (Q741540) (← links)
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
- The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
- The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
- Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Labeling crossed prisms with a condition at distance two (Q2398942) (← links)
- On the universality and extremality of graphs with a distance constrained colouring (Q2674369) (← links)
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE (Q5016312) (← links)
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630) (← links)
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)