Matrix Choosability
暂无分享,去创建一个
[1] J. Edmonds. Minimum partition of a matroid into independent subsets , 1965 .
[2] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[3] Grigory Kogan. Computing permanents over fields of characteristic 3: where and why it becomes difficult , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[4] Nathan Linial,et al. Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties , 1992, J. Comb. Theory, Ser. B.
[5] Noga Alon,et al. Zero-sum sets of prescribed size , 1993 .
[6] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[7] Noga Alon,et al. A nowhere-zero point in linear mappings , 1989, Comb..
[8] Yang Yu. The Permanent Rank of a Matrix , 1999, J. Comb. Theory, Ser. A.
[9] Noga Alon,et al. Additive bases of vector spaces over prime fields , 1991, J. Comb. Theory, Ser. A.
[10] F. Jaeger,et al. Flows and generalized coloring theorems in graphs , 1979, J. Comb. Theory, Ser. B.