The complexity of the $L(p,q)$-labeling problem for bipartite planar graphs of small degree (Q1025950): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2008.09.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2093844568
@@ Property / OpenAlex ID: W2093844568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2718334
@@ Property / cites work: Q2718334 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations for  -Colorings of Graphs
@@ Property / cites work: Approximations for -Colorings of 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 @@
+Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of \(\lambda\)-labelings
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3838194
@@ Property / cites work: Q3838194 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
+Normal rank
@@ Property / cites work @@
+Hard tiling problems with simple tiles
@@ Property / cites work: Hard tiling problems with simple tiles / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank

The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950): Difference between revisions

Latest revision as of 17:29, 1 July 2024

Statements

Sitelinks

Mathematics(1 entry)