Computing L(p, 1)-labeling with combined parameters
From MaRDI portal
Cites work
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- \(T\)-colorings of graphs: recent results and open problems
- A c^k n 5-approximation algorithm for treewidth
- A linear time algorithm for L(2,1)-labeling of trees
- Approximations for -Colorings of Graphs
- Automata, Languages and Programming
- Coloring powers of graphs of bounded clique-width.
- Computing \(L(p, 1)\)-labeling with combined parameters
- Fixed-parameter complexity of \(\lambda\)-labelings
- Graph theory
- Hierarchy of Transportation Network Parameters and Hardness Results
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- scientific article; zbMATH DE number 7650221 (Why is no real title available?)
- Imbalance parameterized by twin cover revisited
- Integer Programming with a Fixed Number of Variables
- Labelling Graphs with a Condition at Distance 2
- On the \(L(p,1)\)-labelling of graphs
- Optimal data reduction for graph coloring using low-degree polynomials
- Parameterized algorithms for the happy set problem
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Parameterized complexity of distance labeling and uniform channel assignment problems
- The $L(2,1)$-Labeling Problem on Graphs
Cited in
(2)
This page was built for publication: Computing \(L(p, 1)\)-labeling with combined parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232248)
