An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees (Q837161): Difference between revisions

@@ 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.1016/j.tcs.2009.04.025
+Normal rank
@@ Property / OpenAlex ID @@
+W2140144078
@@ Property / OpenAlex ID: W2140144078 / 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 @@
+On \(L(d,1)\)-labelings of graphs
@@ Property / cites work: On \(L(d,1)\)-labelings 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 @@
+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 @@
+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 @@
+\((p,1)\)-total labelling of graphs
@@ Property / cites work: \((p,1)\)-total labelling of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+\(T\)-colorings of graphs: recent results and open problems
+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 @@
+On the $\lambda$-Number of $Q_n $ and Related Graphs
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:837161

An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161): Difference between revisions

Latest revision as of 23:37, 1 July 2024

Statements

Sitelinks

Mathematics(1 entry)