Computing L(p,1)-Labeling with Combined Parameters
From MaRDI portal
Publication:5049996
DOI10.7155/jgaa.00592zbMath1498.05233OpenAlexW3087924214MaRDI QIDQ5049996
Tesshu Hanaka, Hirotaka Ono, Kazuma Kawai
Publication date: 14 November 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00592
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- \(T\)-colorings of graphs: recent results and open problems
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Computing \(L(p, 1)\)-labeling with combined parameters
- Optimal data reduction for graph coloring using low-degree polynomials
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Parameterized complexity of distance labeling and uniform channel assignment problems
- On the \(L(p,1)\)-labelling of graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Integer Programming with a Fixed Number of Variables
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Parameterized Algorithms
- Automata, Languages and Programming
- Hierarchy of Transportation Network Parameters and Hardness Results
- Parameterized algorithms for the happy set problem
- Graph-Theoretic Concepts in Computer Science
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: Computing L(p,1)-Labeling with Combined Parameters
