The perfect matching polytope and solid bricks

Journal of Combinatorial Theory, Series B - Tập 92 - Trang 319-324 - 2004
Marcelo H. de Carvalho1,2, Cláudio L. Lucchesi3, U.S.R. Murty
1UFMS, Campo Grande, Brasil
2University of Waterloo, Waterloo, Canada
3UNICAMP, Campinas, Brasil

Tài liệu tham khảo

de Carvalho, 2002, On a conjecture of Lovász concerning bricks. I. The characteristic of a matching covered graph, J. Combin. Theory (B), 85, 94, 10.1006/jctb.2001.2091 de Carvalho, 2002, On a conjecture of Lovász concerning bricks. II. Bricks of finite characteristic, J. Combin. Theory (B), 85, 137, 10.1006/jctb.2001.2092 Edmonds, 1965, Maximum matching and a polyhedron with (0,1) vertices, J. Res. Nat. Bur. Standards Sect B., 69B, 125, 10.6028/jres.069B.013 Lovász, 1987, Matching structure and the matching lattice, J. Combin. Theory (B), 43, 187, 10.1016/0095-8956(87)90021-9 L. Lovász, M.D. Plummer, Matching Theory, Annals of Discrete Mathematics, Vol. 29, Elsevier Science, Amsterdam, 1986. Tutte, 1947, The factorization of linear graphs, J. London Math. Soc., 22, 107, 10.1112/jlms/s1-22.2.107