Fixed-parameter complexity of -labelings
From MaRDI portal
Publication:5948961
Recommendations
Cites work
- scientific article; zbMATH DE number 91031 (Why is no real title available?)
- scientific article; zbMATH DE number 1236360 (Why is no real title available?)
- scientific article; zbMATH DE number 1263991 (Why is no real title available?)
- scientific article; zbMATH DE number 1107736 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 881282 (Why is no real title available?)
- scientific article; zbMATH DE number 1409224 (Why is no real title available?)
- scientific article; zbMATH DE number 1409249 (Why is no real title available?)
- Algorithms for Square Roots of Graphs
- Covering regular graphs
- Graph labeling and radio channel assignment
- Labeling Chordal Graphs: Distance Two Condition
- Labelling Graphs with a Condition at Distance 2
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Regular codes in regular graphs are difficult
- Relating path coverings to vertex labellings with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
Cited in
(68)- The complexity of \(L(p, q)\)-edge-labelling
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Computing \(L(p, 1)\)-labeling with combined parameters
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- Comparing universal covers in polynomial time
- scientific article; zbMATH DE number 1420920 (Why is no real title available?)
- Threshold-coloring and unit-cube contact representation of planar graphs
- Computing role assignments of chordal graphs
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- On circular-L(2, 1)-labellings of products of graphs
- Graph labellings with variable weights, a survey
- \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- Labeling planar graphs with a condition at distance two
- Parameterized complexity of distance labeling and uniform channel assignment problems
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- On improved exact algorithms for \(L(2,1)\)-labeling of graphs
- Comparing Universal Covers in Polynomial Time
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
- Algorithmic complexity of proper labeling problems
- More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On the computational complexity of partial covers of theta graphs
- Complexity of (p,1)-total labelling
- Computing role assignments of proper interval graphs in polynomial time
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
- The \(L(h,1,1)\)-labelling problem for trees
- On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
- Determining the \(L(2,1)\)-span in polynomial space
- Distance three labelings of trees
- Systems of distant representatives
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- Locally constrained graph homomorphisms and equitable partitions
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- Distance Constrained Labelings of Trees
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms
- An exact algorithm for the channel assignment problem
- Distance constrained labelings of planar graphs with no short cycles
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Colorings with few colors: counting, enumeration and combinatorial bounds
- scientific article; zbMATH DE number 2044507 (Why is no real title available?)
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Theory of computational complexity. Part 7. Transl. from the Russian
- Facial \(L(2, 1)\)-edge-labelings of trees
- A complete complexity classification of the role assignment problem
- The complexity of \(L(p, q)\)-edge-labelling
- scientific article; zbMATH DE number 7651161 (Why is no real title available?)
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Graph labelings and complexity problems: a review
- A linear algorithm for radio \(k\)-coloring of powers of paths having small diameters
- On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT
- On structural parameterizations of \textsc{Hitting Set}: hitting paths in graphs using 2-SAT
- Computing L(p,1)-Labeling with Combined Parameters
- An algorithmic framework for locally constrained homomorphisms
- Graph covers: where topology meets computer science, and simple means difficult
- An algorithmic framework for locally constrained homomorphisms
- Computing role assignments of proper interval graphs in polynomial time
This page was built for publication: Fixed-parameter complexity of \(\lambda\)-labelings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948961)
