T. Brylawski, The broken-circuit complex, Transactions of the American Mathematical Society, vol.234, issue.2, pp.417-433, 1977.
DOI : 10.1090/S0002-9947-1977-0468931-6

T. Brylawski and &. J. Oxley, The Broken-circuit Complex: Its Structure and Factorizations, European Journal of Combinatorics, vol.2, issue.2, pp.107-121, 1981.
DOI : 10.1016/S0195-6698(81)80001-7

K. Dohmen, Improved Bonferroni Inequalities via Union-Closed Set Systems, Journal of Combinatorial Theory, Series A, vol.92, issue.1, pp.61-67, 2000.
DOI : 10.1006/jcta.1999.3030
URL : http://doi.org/10.1006/jcta.1999.3030

C. Godsil and &. G. Royle, Algebraic Graph Theory, Graduate Texts in Mathematics, vol.207, 2001.
DOI : 10.1007/978-1-4613-0163-9

F. Lazebnik, Some corollaries of a theorem of Whitney on the chromatic polynomial, Discrete Math, pp.53-64, 1991.

P. Scheffler, Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme, 1989.

D. M. Thilikos, M. J. Serna, and H. L. Bodlaender, Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width, Proc. 11th International Symposium on Algorithms and Computation, ISAAC '00, pp.192-203, 1969.
DOI : 10.1007/3-540-40996-3_17

H. Whitney, A logical expansion in mathematics, Bulletin of the American Mathematical Society, vol.38, issue.8, pp.572-579, 1932.
DOI : 10.1090/S0002-9904-1932-05460-X

H. S. Wilf, Which polynomials are chromatic?, Proc. Colloquio Internazionale sulle Teorie Combinatorie Tomo I, Atti dei Convegni Lincei, pp.247-256, 1973.