Characterization results for the $L(2, 1, 1)$-labeling problem on trees (Q2364083): Difference between revisions

@@ Property / author @@
+Xiao-Ling Zhang
@@ Property / author: Xiao-Ling Zhang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.7151/dmgt.1935
@@ Property / full work available at URL: https://doi.org/10.7151/dmgt.1935 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2549340483
@@ Property / OpenAlex ID: W2549340483 / 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 @@
+\(L(3,2,1)\)-labeling of graphs
@@ Property / cites work: \(L(3,2,1)\)-labeling of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distance three labelings of trees
@@ Property / cites work: Distance three labelings of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Labeling trees with a condition at distance two.
@@ Property / cites work: Labeling trees with a condition at distance two. / rank @@
+Normal rank
@@ Property / cites work @@
+L(2,1,1)-Labeling Is NP-Complete for Trees
@@ Property / cites work: L(2,1,1)-Labeling Is NP-Complete for Trees / rank @@
+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 @@
+Distance three labelings for direct products of three complete graphs
+Normal rank
@@ Property / cites work @@
+The \(L(h,1,1)\)-labelling problem for trees
@@ Property / cites work: The \(L(h,1,1)\)-labelling problem for trees / rank @@
+Normal rank
@@ Property / cites work @@
+The \(L(2,1)\)-labelling of trees
@@ Property / cites work: The \(L(2,1)\)-labelling of trees / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank
@@ Property / cites work @@
+A distance-labelling problem for hypercubes
@@ Property / cites work: A distance-labelling problem for hypercubes / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2364083

Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083): Difference between revisions

Latest revision as of 04:04, 14 July 2024

Statements

Sitelinks

Mathematics(1 entry)