Optimal channel assignment and $L(p,1)$-labeling (Q1630278): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1007/s10898-018-0647-9
-Normal rank
@@ Property / OpenAlex ID @@
-W2796048330
@@ Property / OpenAlex ID: W2796048330 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-018-0647-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2796048330
@@ Property / OpenAlex ID: W2796048330 / rank @@
+Normal rank
@@ Property / cites work @@
+\(T\)-colorings of graphs: recent results and open problems
+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 @@
+Q5422499
@@ Property / cites work: Q5422499 / 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 @@
+On the \(L(p,1)\)-labelling of graphs
@@ Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Griggs and Yeh's Conjecture and $L(p,1)$-labelings
+Normal rank
@@ Property / cites work @@
+Labeling planar graphs with a condition at distance two
+Normal rank
@@ Property / cites work @@
+Coloring the square of a planar graph
@@ Property / cites work: Coloring the square of a planar graph / 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 Planar Graphs with Conditions on Girth and Distance Two
+Normal rank
@@ Property / cites work @@
+Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
+Normal rank
@@ Property / cites work @@
+The \(L(p, q)\)-labelling of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+An optimal square coloring of planar graphs
@@ Property / cites work: An optimal square coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An improved bound on 2-distance coloring plane graphs with girth 5
+Normal rank
@@ Property / cites work @@
+Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
+Normal rank
@@ Property / cites work @@
+Strong edge-coloring of subcubic planar graphs
@@ Property / cites work: Strong edge-coloring of subcubic planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on 3-choosability of plane graphs under distance restrictions
+Normal rank
@@ Property / cites work @@
+Radio k-chromatic number of cycles for large k
@@ Property / cites work: Radio k-chromatic number of cycles for large k / rank @@
+Normal rank
@@ Property / cites work @@
+b-Chromatic sum of a graph
@@ Property / cites work: b-Chromatic sum of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for the dichromatic number of a generalized lexicographic product of digraphs
+Normal rank

Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278): Difference between revisions

Latest revision as of 15:35, 17 July 2024

Statements

Sitelinks

Mathematics(1 entry)