$L(j,k)$-labelling and maximum ordering-degrees for trees (Q968198): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2009.11.018
@@ Property / DOI: 10.1016/j.dam.2009.11.018 / 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.1016/j.dam.2009.11.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2000225603
@@ Property / OpenAlex ID: W2000225603 / 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 @@
+Distance-two labelings of graphs
@@ Property / cites work: Distance-two 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 @@
+On \(L(d,1)\)-labelings of graphs
@@ Property / cites work: On \(L(d,1)\)-labelings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Pair Labellings with Given Distance
@@ Property / cites work: Pair Labellings with Given Distance / rank @@
+Normal rank
@@ Property / cites work @@
+Q3838194
@@ Property / cites work: Q3838194 / 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 @@
+On the $\lambda$-Number of $Q_n $ and Related Graphs
+Normal rank
@@ Property / cites work @@
+Real Number Graph Labellings with Distance Conditions
+Normal rank
@@ Property / cites work @@
+Real Number Channel Assignments for Lattices
@@ Property / cites work: Real Number Channel Assignments for Lattices / 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 @@
+Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
+Normal rank
@@ Property / cites work @@
+Q4940064
@@ Property / cites work: Q4940064 / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of the square of a planar graph
+Normal rank
@@ Property / cites work @@
+Labeling Chordal Graphs: Distance Two Condition
@@ Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2009.11.018
@@ Property / DOI: 10.1016/J.DAM.2009.11.018 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:968198

\(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198): Difference between revisions

Latest revision as of 10:26, 10 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)