A note on the strength and minimum color sum of bipartite graphs (Q967294): 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.2009.03.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2029462843
@@ Property / OpenAlex ID: W2029462843 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal coloring and strength of graphs
@@ Property / cites work: Minimal coloring and strength of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4719325
@@ Property / cites work: Q4719325 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic sum of a graph: history and recent developments
+Normal rank
@@ Property / cites work @@
+Sum coloring of bipartite graphs with bounded degree
+Normal rank
@@ Property / cites work @@
+The complexity of chromatic strength and chromatic edge strength
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:967294