$L(d,1)$-labelings of the edge-path-replacement of a graph (Q386438): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-012-9487-6
@@ Property / DOI: 10.1007/s10878-012-9487-6 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 90C35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6236745
@@ Property / zbMATH DE Number: 6236745 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+channel assignment
@@ Property / zbMATH Keywords: channel assignment / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(L(j,k)\)-labeling
@@ Property / zbMATH Keywords: \(L(j,k)\)-labeling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\((d,1)\)-total labeling
@@ Property / zbMATH Keywords: \((d,1)\)-total labeling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge-path-replacement
@@ Property / zbMATH Keywords: edge-path-replacement / 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.1007/s10878-012-9487-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2077288023
@@ Property / OpenAlex ID: W2077288023 / rank @@
+Normal rank
@@ Property / cites work @@
+Total colorings of planar graphs with large maximum degree
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+Total colourings of planar graphs with large girth
+Normal rank
@@ Property / cites work @@
+On labeling the vertices of products of complete graphs with distance constraints
+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 @@
+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 @@
+On unavoidability of trees with \(k\) leaves
@@ Property / cites work: On unavoidability of trees with \(k\) leaves / 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 @@
+Q4535043
@@ Property / cites work: Q4535043 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
+Normal rank
@@ Property / cites work @@
+Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
+Normal rank
@@ Property / cites work @@
+\(L(2,1)\)-labeling of direct product of paths and cycles
+Normal rank
@@ Property / cites work @@
+Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
+Normal rank
@@ Property / cites work @@
+Q4552180
@@ Property / cites work: Q4552180 / rank @@
+Normal rank
@@ Property / cites work @@
+On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
+Normal rank
@@ Property / cites work @@
+\(L(2, 1)\)-labelings of the edge-path-replacement of a graph
+Normal rank
@@ Property / cites work @@
+On the total coloring of certain graphs
@@ Property / cites work: On the total coloring of certain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+\(L(2,1)\)-labelings of Cartesian products of two cycles
+Normal rank
@@ Property / cites work @@
+On Total Chromatic Number of a Graph
@@ Property / cites work: On Total Chromatic Number of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the $\lambda$-Number of $Q_n $ and Related Graphs
+Normal rank
@@ Property / DOI @@
+.1007/S10878-012-9487-6
@@ Property / DOI: 10.1007/S10878-012-9487-6 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:386438

\(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438): Difference between revisions

Latest revision as of 16:04, 9 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)