Extensions of matroid covering and packing (Q1633609): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2018.09.010
@@ Property / DOI: 10.1016/j.ejc.2018.09.010 / rank @@
-Normal rank
@@ Property / author @@
-Geng-Hua Fan
@@ Property / author: Geng-Hua Fan / rank @@
-Normal rank
@@ Property / author @@
+Geng-Hua Fan
@@ Property / author: Geng-Hua Fan / 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.1016/j.ejc.2018.09.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2897228683
@@ Property / OpenAlex ID: W2897228683 / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional arboricity, strength, and principal partitions in graphs and matroids
+Normal rank
@@ Property / cites work @@
+On the higher-order edge toughness of a graph
@@ Property / cites work: On the higher-order edge toughness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5284569
@@ Property / cites work: Q5284569 / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of Nash-Williams' theorem for the arboricity of a graph
+Normal rank
@@ Property / cites work @@
+Lehmans switching game and a theorem of Tutte and Nash-Williams
+Normal rank
@@ Property / cites work @@
+Minimum partition of a matroid into independent subsets
+Normal rank
@@ Property / cites work @@
+Transversals and matroid partition
@@ Property / cites work: Transversals and matroid partition / rank @@
+Normal rank
@@ Property / cites work @@
+Q4696619
@@ Property / cites work: Q4696619 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into pseudoforests with one having bounded degree
+Normal rank
@@ Property / cites work @@
+Q2713657
@@ Property / cites work: Q2713657 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests: the nine dragon tree conjecture is true
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests
@@ Property / cites work: Decomposing a graph into forests / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+On the spanning tree packing number of a graph: A survey
+Normal rank
@@ Property / cites work @@
+Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
+Normal rank
@@ Property / cites work @@
+NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Q4111952
@@ Property / cites work: Q4111952 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a graph into forests and a matching
@@ Property / cites work: Decomposing a graph into forests and a matching / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129071680
@@ Property / Wikidata QID: Q129071680 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2018.09.010
@@ Property / DOI: 10.1016/J.EJC.2018.09.010 / rank @@
+Normal rank