Pages that link to "Item:Q2497501"
From MaRDI portal
The following pages link to A survey on labeling graphs with a condition at distance two (Q2497501):
Displayed 14 items.
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\) (Q1003771) (← links)
- \(L(h,1,1)\)-labeling of outerplanar graphs (Q1014311) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- Labeling bipartite permutation graphs with a condition at distance two (Q1026125) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
- An extremal problem on non-full colorable graphs (Q2384400) (← links)
- On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs (Q2457022) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)
- On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees (Q5191141) (← links)