On the complexity of determining the irregular chromatic index of a graph (Q2253909): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2014.12.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2083522205
@@ Property / OpenAlex ID: W2083522205 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colouring edge partitions
@@ Property / cites work: Vertex colouring edge partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic complexity of proper labeling problems
+Normal rank
@@ Property / cites work @@
+Highly irregular graphs
@@ Property / cites work: Highly irregular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposing regular graphs into locally irregular subgraphs
+Normal rank
@@ Property / cites work @@
+Q3824455
@@ Property / cites work: Q3824455 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5403005
@@ Property / cites work: Q5403005 / rank @@
+Normal rank
@@ Property / cites work @@
+A dynamic survey of graph labeling
@@ Property / cites work: A dynamic survey of graph labeling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+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 Tight Bound on the Irregularity Strength of Graphs
+Normal rank
@@ Property / cites work @@
+Q3575472
@@ Property / cites work: Q3575472 / rank @@
+Normal rank