Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference4 articles.
1. G. Ding: Graphs with not too many spanning trees, accepted byNetworks.
2. G. Ding, andB. Oporowski: A Ramsey type theorem, in preparation.
3. G. Ding, P. D. Seymour, andP. Winkler: Bounding the vertex cover number of a hypergraph,Combinatorica 14 (1) (1994) 23?34.
4. D. J. A. Welsh:Matroid theory. Academic Press, London, 1976.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献