On decomposing multigraphs into locally irregular submultigraphs (Q6105994): Difference between revisions

@@ Property / cites work @@
+Q5377221
@@ Property / cites work: Q5377221 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of determining the irregular chromatic index of a graph
+Normal rank
@@ Property / cites work @@
+On decomposing regular graphs into locally irregular subgraphs
+Normal rank
@@ Property / cites work @@
+Decomposing graphs into a constant number of locally irregular subgraphs
+Normal rank
@@ Property / cites work @@
+Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
+Normal rank
@@ Property / cites work @@
+Edge weights and vertex colours
@@ Property / cites work: Edge weights and vertex colours / rank @@
+Normal rank
@@ Property / cites work @@
+A new upper bound on the game chromatic index of graphs
+Normal rank
@@ Property / cites work @@
+New bounds for locally irregular chromatic index of bipartite and subcubic graphs
+Normal rank
@@ Property / cites work @@
+On decomposing graphs of large minimum degree into locally irregular subgraphs
+Normal rank
@@ Property / cites work @@
+The 1-2-3 conjecture almost holds for regular graphs
+Normal rank
@@ Property / cites work @@
+Metric dimensions vs. cyclomatic number of graphs with minimum degree at least two
+Normal rank
@@ Property / cites work @@
+Multi-set neighbor distinguishing 3-edge coloring
@@ Property / cites work: Multi-set neighbor distinguishing 3-edge coloring / rank @@
+Normal rank