Some upper bounds on the total and list chromatic numbers of multigraphs (Q4020707): Difference between revisions

@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3853641
@@ Property / cites work: Q3853641 / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted Edge-colourings of Bipartite Graphs
@@ Property / cites work: Restricted Edge-colourings of Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the total chromatic number
@@ Property / cites work: An upper bound for the total chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035311
@@ Property / cites work: Q3035311 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Coloring the Lines of a Network
@@ Property / cites work: A Theorem on Coloring the Lines of a Network / rank @@
+Normal rank
@@ Property / cites work @@
+Q5552725
@@ Property / cites work: Q5552725 / rank @@
+Normal rank