The distinguishing index of connected graphs without pendant edges (Q4988841): 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.26493/1855-3974.1852.4f7
+Normal rank
@@ Property / OpenAlex ID @@
+W3042784797
@@ Property / OpenAlex ID: W3042784797 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound on the distinguishing index of graphs with minimum degree at least two
+Normal rank
@@ Property / cites work @@
+The distinguishing index of infinite graphs
@@ Property / cites work: The distinguishing index of infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374865
@@ Property / cites work: Q3374865 / rank @@
+Normal rank
@@ Property / cites work @@
+The distinguishing index of the Cartesian product of finite graphs
+Normal rank
@@ Property / cites work @@
+Distinguishing graphs by edge-colourings
@@ Property / cites work: Distinguishing graphs by edge-colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Breaking graph symmetries by edge colourings
@@ Property / cites work: Breaking graph symmetries by edge colourings / rank @@
+Normal rank
@@ Property / cites work @@
+A bound for the distinguishing index of regular graphs
+Normal rank
@@ Property / cites work @@
+Improving upper bounds for the distinguishing index
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4988841