Extensions of matroid covering and packing
Publication:1633609
DOI10.1016/J.EJC.2018.09.010zbMath1402.05032OpenAlexW2897228683WikidataQ129071680 ScholiaQ129071680MaRDI QIDQ1633609
Ping Li, Daqing Yang, Douglas B. West, Hongbi Jiang, Xuding Zhu, Geng-Hua Fan
Publication date: 20 December 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2018.09.010
Extremal problems in graph theory (05C35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of packing and covering (05B40)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing a graph into pseudoforests with one having bounded degree
- On the higher-order edge toughness of a graph
- Decomposing a graph into forests: the nine dragon tree conjecture is true
- Decomposing a graph into forests
- Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- A short proof of Nash-Williams' theorem for the arboricity of a graph
- Decomposing a graph into forests and a matching
- NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Transversals and matroid partition
- Minimum partition of a matroid into independent subsets
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Decomposition of Finite Graphs Into Forests
- On the spanning tree packing number of a graph: A survey
This page was built for publication: Extensions of matroid covering and packing
