$(2,1)$-Total number of trees with maximum degree three (Q989489): 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.ipl.2009.03.027
+Normal rank
@@ Property / OpenAlex ID @@
+W1995823878
@@ Property / OpenAlex ID: W1995823878 / rank @@
+Normal rank
@@ Property / cites work @@
+\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
+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 @@
+\((2,1)\)-total labelling of outerplanar graphs
@@ Property / cites work: \((2,1)\)-total labelling of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5492304
@@ Property / cites work: Q5492304 / 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 @@
+\((p,1)\)-total labelling of graphs
@@ Property / cites work: \((p,1)\)-total labelling of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+(2,1)-total labelling of trees with sparse vertices of maximum degree
+Normal rank
@@ Property / cites work @@
+$L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3
+Normal rank
@@ Property / cites work @@
+\([r,s,t]\)-colorings of graphs
@@ Property / cites work: \([r,s,t]\)-colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \((d,1)\)-total numbers of graphs
@@ Property / cites work: On \((d,1)\)-total numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of the square of a planar graph
+Normal rank
@@ Property / cites work @@
+(d,1)-total labeling of graphs with a given maximum average degree
+Normal rank
@@ Property / cites work @@
+Labeling Planar Graphs with Conditions on Girth and Distance Two
+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

\((2,1)\)-Total number of trees with maximum degree three (Q989489): Difference between revisions

Latest revision as of 03:20, 3 July 2024

Statements

Sitelinks

Mathematics(1 entry)