The $L(2,1)$-labeling on graphs and the frequency assignment problem (Q2472818): Difference between revisions

@@ Property / cites work @@
+Q4501549
@@ Property / cites work: Q4501549 / rank @@
+Normal rank
@@ Property / cites work @@
+Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
+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 @@
+Q4944992
@@ Property / cites work: Q4944992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3838194
@@ Property / cites work: Q3838194 / rank @@
+Normal rank
@@ Property / cites work @@
+Labeling Products of Complete Graphs with a Condition at Distance Two
+Normal rank
@@ Property / cites work @@
+Relating path coverings to vertex labellings with a condition at distance two
+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 @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552180
@@ Property / cites work: Q4552180 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem about the Channel Assignment Problem
@@ Property / cites work: A Theorem about the Channel Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
+Normal rank
@@ Property / cites work @@
+Q4940064
@@ Property / cites work: Q4940064 / rank @@
+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 @@
+The L(2,1)-labeling and operations of graphs
@@ Property / cites work: The L(2,1)-labeling and operations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The \(L(2,1)\)-labeling on planar graphs
@@ Property / cites work: The \(L(2,1)\)-labeling on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the $\lambda$-Number of $Q_n $ and Related Graphs
+Normal rank

The \(L(2,1)\)-labeling on graphs and the frequency assignment problem (Q2472818): Difference between revisions

Revision as of 16:48, 27 June 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)