Arrangements, Channel Assignments, and Associated Polynomials
暂无分享，去创建一个
[1] Tom Brylawski. Intersection theory for graphs , 1981, J. Comb. Theory, Ser. B.
[2] A. Vince,et al. Star chromatic number , 1988, J. Graph Theory.
[3] François Jaeger,et al. Chromatic invariants for finite graphs: Theme and polynomial variations , 1995 .
[4] Andreas Blass,et al. Characteristic and Ehrhart Polynomials , 1998 .
[5] G. Rota,et al. On The Foundations of Combinatorial Theory: Combinatorial Geometries , 1970 .
[6] Joseph P. S. Kung,et al. The Rédei Function of a Relation , 1980, J. Comb. Theory, Ser. A.
[7] Geoff Whittle. Characteristic Polynomials of Weighted Lattices , 1993 .
[8] T. Helgason. Aspects of the theory of hypermatroids , 1974 .
[9] L. G. Anderson. A Simulation Study of Some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications System , 1973, IEEE Trans. Commun..
[10] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .
[11] Geoff Whittle,et al. A geometric theory of hypergraph colouring , 1991 .
[12] Tom Brylawski,et al. Intersection Theory for Embeddings of Matroids into Uniform Geometries , 1979 .
[13] Geoff Whittle. THE CRITICAL PROBLEM FOR POLYMATROIDS , 1994 .
[14] Thomas Zaslavsky,et al. Combinatorial Geometries: The Möbius Function and the Characteristic Polynomial , 1987 .
[15] Christos A. Athanasiadis. Characteristic Polynomials of Subspace Arrangements and Finite Fields , 1996 .