Distant total irregularity strength of graphs via random vertex ordering (Q1699557): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2594263019
@@ Property / OpenAlex ID: W2594263019 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00376
@@ Property / arXiv ID: 1703.00376 / rank @@
+Normal rank
@@ Property / cites work @@
+Irregular Assignments of Trees and Forests
@@ Property / cites work: Irregular Assignments of Trees and Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q2784326
@@ Property / cites work: Q2784326 / rank @@
+Normal rank
@@ Property / cites work @@
+A new upper bound for the total vertex irregularity strength of graphs
+Normal rank
@@ Property / cites work @@
+On irregular total labellings
@@ Property / cites work: On irregular total labellings / rank @@
+Normal rank
@@ Property / cites work @@
+On the irregularity strength of trees
@@ Property / cites work: On the irregularity strength of trees / rank @@
+Normal rank
@@ Property / cites work @@
+How to Define an Irregular Graph
@@ Property / cites work: How to Define an Irregular Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3824455
@@ Property / cites work: Q3824455 / rank @@
+Normal rank
@@ Property / cites work @@
+Irregularity strength of dense graphs
@@ Property / cites work: Irregularity strength of dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the irregularity strength of them ×n grid
@@ Property / cites work: On the irregularity strength of them ×n grid / rank @@
+Normal rank
@@ Property / cites work @@
+Irregular networks, regular graphs and integer matrices with distinct row and column sums
+Normal rank
@@ Property / cites work @@
+Q3474681
@@ Property / cites work: Q3474681 / rank @@
+Normal rank
@@ Property / cites work @@
+On graph irregularity strength
@@ Property / cites work: On graph irregularity strength / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Upper Bound for the Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+A survey on the distance-colouring of graphs
@@ Property / cites work: A survey on the distance-colouring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873753
@@ Property / cites work: Q4873753 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Irregularity Strength of Dense Graphs
@@ Property / cites work: On the Irregularity Strength of Dense Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total Vertex Irregularity Strength of Dense Graphs
+Normal rank
@@ Property / cites work @@
+A Tight Bound on the Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+On the total vertex irregularity strength of trees
+Normal rank
@@ Property / cites work @@
+Irregularity strength of regular graphs
@@ Property / cites work: Irregularity strength of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+Distant irregularity strength of graphs
@@ Property / cites work: Distant irregularity strength of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Distant irregularity strength of graphs with bounded minimum degree
+Normal rank
@@ Property / cites work @@
+Q3575472
@@ Property / cites work: Q3575472 / rank @@
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs
@@ Property / cites work: Total weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total irregularity strength of three families of graphs
+Normal rank
@@ Property / cites work @@
+Total weight choosability of graphs
@@ Property / cites work: Total weight choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every graph is \((2,3)\)-choosable
@@ Property / cites work: Every graph is \((2,3)\)-choosable / rank @@
+Normal rank