Pages that link to "Item:Q5948961"
From MaRDI portal
The following pages link to Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961):
Displayed 21 items.
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Systems of distant representatives (Q1764814) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- Theory of computational complexity. Part 7. Transl. from the Russian (Q1781794) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees (Q3512458) (← links)