论文信息 - Biased Positional Games - 字舞流文

Biased Positional Games

P. Erdös | V. Chvátal

[1] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .

[2] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[3] A. Hales,et al. Regularity and Positional Games , 1963 .

[4] Alfred Lehman,et al. A Solution of the Shannon Switching Game , 1964 .

[5] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .

[6] Jack Edmonds,et al. Lehmans switching game and a theorem of Tutte and Nash-Williams , 1965 .

[7] Paul Erdös,et al. On a Combinatorial Game , 1973, J. Comb. Theory A.