On the acyclic choosability of graphs (Q5469027): Difference between revisions

@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
+Normal rank
@@ 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.1002/jgt.20134
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20134 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2307903789
@@ Property / OpenAlex ID: W2307903789 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5469027