The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498): Difference between revisions

@@ Property / cites work @@
+\((d,1)\)-total labelling of planar graphs with large girth and high maximum degree
+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 @@
+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 @@
+A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs
+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 @@
+On \((d,1)\)-total numbers of graphs
@@ Property / cites work: On \((d,1)\)-total numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+(d,1)-total labeling of graphs with a given maximum average degree
+Normal rank
@@ Property / cites work @@
+SOME UNSOLVED PROBLEMS IN GRAPH THEORY
@@ Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank @@
+Normal rank
@@ Property / cites work @@
+On the $\lambda$-Number of $Q_n $ and Related Graphs
+Normal rank
@@ Property / cites work @@
+A survey on labeling graphs with a condition at distance two
+Normal rank