The following pages link to (Q3579493):
Displaying 25 items.
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
- \(L(2,1)\)-labelling of generalized prisms (Q415277) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
- Labeling the \(r\)-path with a condition at distance two (Q967377) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
- Some results on the injective chromatic number of graphs (Q1928520) (← links)
- On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← links)
- Weighted improper colouring (Q1932354) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- On \(L(2 , 1)\)-labelings of oriented graphs (Q2062670) (← links)
- \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs (Q2181256) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- L(3,1)-labeling of circulant graphs (Q5063266) (← links)
- On the<i>L</i>(2, 1)-labelling of block graphs (Q5391500) (← links)
- On radio \(k\)-labeling of the power of the infinite path (Q6161446) (← links)
- n-fold L(2, 1)-labelings of Cartesian product of paths and cycles (Q6497036) (← links)
