Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph (Q4883064): Difference between revisions

@@ Property / cites work @@
+A note on list-colorings
@@ Property / cites work: A note on list-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+A new upper bound for the list chromatic number
@@ Property / cites work: A new upper bound for the list chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+List-colourings of graphs
@@ Property / cites work: List-colourings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings and orientations of graphs
@@ Property / cites work: Colorings and orientations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Kernels in perfect line-graphs
@@ Property / cites work: Kernels in perfect line-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Dinitz problem solved for rectangles
@@ Property / cites work: The Dinitz problem solved for rectangles / rank @@
+Normal rank
@@ Property / cites work @@
+College Admissions and the Stability of Marriage
@@ Property / cites work: College Admissions and the Stability of Marriage / rank @@
+Normal rank
@@ Property / cites work @@
+The list chromatic index of a bipartite multigraph
+Normal rank
@@ Property / cites work @@
+Using euler partitions to edge color bipartite multigraphs
+Normal rank