$k-L(2,1)$-labelling for planar graphs is NP-complete for $k\geq 4$ (Q602756): Difference between revisions

@@ Property / cites work @@
+Labeling planar graphs with a condition at distance two
+Normal rank
@@ Property / cites work @@
+Approximations for  -Colorings of Graphs
@@ Property / cites work: Approximations for -Colorings of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(L(h,1)\)-labeling subclasses of planar graphs
@@ Property / cites work: \(L(h,1)\)-labeling subclasses of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The $L(2,1)$-Labeling Problem on Graphs
@@ Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of \(\lambda\)-labelings
+Normal rank
@@ Property / cites work @@
+Q4536372
@@ Property / cites work: Q4536372 / rank @@
+Normal rank
@@ Property / cites work @@
+Radiocoloring in planar graphs: Complexity and approximations
+Normal rank
@@ Property / cites work @@
+Labelling Graphs with a Condition at Distance 2
@@ Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for L(2,1)-Labeling of Trees
+Normal rank
@@ Property / cites work @@
+An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
+Normal rank
@@ Property / cites work @@
+List Colouring Squares of Planar Graphs
@@ Property / cites work: List Colouring Squares of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579493
@@ Property / cites work: Q3579493 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of (p,1)-total labelling
@@ Property / cites work: Complexity of (p,1)-total labelling / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the square of a planar graph
@@ Property / cites work: Coloring the square of a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank

\(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756): Difference between revisions

Latest revision as of 09:56, 3 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)