$(2,1)$-total labelling of outerplanar graphs (Q2462398): 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.dam.2007.07.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2016768523
@@ Property / OpenAlex ID: W2016768523 / 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 @@
+List edge and list total colourings of multigraphs
+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 @@
+On the chromatic index of outerplanar graphs
@@ Property / cites work: On the chromatic index of outerplanar graphs / 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 @@
+\([r,s,t]\)-colorings of graphs
@@ Property / cites work: \([r,s,t]\)-colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The total chromatic number of any multigraph with maximum degree five is at most seven
+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 @@
+A bound on the total chromatic number
@@ Property / cites work: A bound on the total chromatic number / 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 Chordal Graphs: Distance Two Condition
@@ Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank @@
+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 @@
+Total chromatic number of planar graphs with maximum degree ten
+Normal rank
@@ Property / cites work @@
+Labeling Planar Graphs with Conditions on Girth and Distance Two
+Normal rank
@@ Property / cites work @@
+Q4528373
@@ Property / cites work: Q4528373 / rank @@
+Normal rank
@@ Property / cites work @@
+On the $\lambda$-Number of $Q_n $ and Related Graphs
+Normal rank

\((2,1)\)-total labelling of outerplanar graphs (Q2462398): Difference between revisions

Latest revision as of 13:44, 27 June 2024

Statements

Sitelinks

Mathematics(1 entry)