Pages that link to "Item:Q5948961"
From MaRDI portal
The following pages link to Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961):
Displaying 50 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Distance three labelings of trees (Q415278) (← links)
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← 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)
- Computing role assignments of chordal graphs (Q708211) (← links)
- 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)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Complexity of (p,1)-total labelling (Q967327) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- Comparing universal covers in polynomial time (Q987372) (← 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)
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Facial \(L(2, 1)\)-edge-labelings of trees (Q1671360) (← 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)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← 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)
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- On Improved Exact Algorithms for L(2,1)-Labeling of Graphs (Q3000491) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
