Abreu, Nair; Costa, Liliana; Nascimento, Carlos; Patuzzi, Laura Skeleton matching polytope: realization and isomorphism. (English) Zbl 1421.05031 Discrete Appl. Math. 269, 27-31 (2019). MSC: 05C10 05C60 05C70 PDF BibTeX XML Cite \textit{N. Abreu} et al., Discrete Appl. Math. 269, 27--31 (2019; Zbl 1421.05031) Full Text: DOI
Cornaz, Denis; Mahjoub, A. Ridha The maximum induced bipartite subgraph problem with edge weights. (English) Zbl 1141.05076 SIAM J. Discrete Math. 21, No. 3, 662-675 (2007). MSC: 05C85 90C27 90C57 PDF BibTeX XML Cite \textit{D. Cornaz} and \textit{A. R. Mahjoub}, SIAM J. Discrete Math. 21, No. 3, 662--675 (2007; Zbl 1141.05076) Full Text: DOI
Fouilhoux, Pierre; Mahjoub, A. Ridha Polyhedral results for the bipartite induced subgraph problem. (English) Zbl 1102.68673 Discrete Appl. Math. 154, No. 15, 2128-2149 (2006). MSC: 68R10 05C70 90C57 PDF BibTeX XML Cite \textit{P. Fouilhoux} and \textit{A. R. Mahjoub}, Discrete Appl. Math. 154, No. 15, 2128--2149 (2006; Zbl 1102.68673) Full Text: DOI
Eisenbrand, Friedrich; Rinaldi, Giovanni; Ventura, Paolo Primal separation for 0/1 polytopes. (English) Zbl 1023.90041 Math. Program. 95, No. 3 (A), 475-491 (2003). MSC: 90C09 90C60 90C57 90C27 PDF BibTeX XML Cite \textit{F. Eisenbrand} et al., Math. Program. 95, No. 3 (A), 475--491 (2003; Zbl 1023.90041) Full Text: DOI
Poljak, Svatopluk; Tuza, Zsolt Maximum cuts and large bipartite subgraphs. (English) Zbl 0834.05001 Cook, William (ed.) et al., Combinatorial optimization. Papers from the DIMACS special year. Papers from workshops held at DIMACS at Rutgers University, New Brunswick, NJ, USA, Sept. 1992-Aug. 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 20, 181-244 (1995). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05-02 05C85 52B12 05C35 90C27 05C40 05C90 68R10 PDF BibTeX XML Cite \textit{S. Poljak} and \textit{Z. Tuza}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 20, 181--244 (1995; Zbl 0834.05001)
Poljak, S. Polyhedral and eigenvalue approximations of the max-cut problem. (English) Zbl 0792.05102 Halász, G. (ed.) et al., Sets, graphs and numbers. A birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland Publishing Company. Colloq. Math. Soc. János Bolyai. 60, 569-581 (1992). Reviewer: B.Mohar (Ljubljana) MSC: 05C50 05C99 68R10 90C27 PDF BibTeX XML Cite \textit{S. Poljak}, in: Sets, graphs and numbers. A birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland Publishing Company. 569--581 (1992; Zbl 0792.05102)
Poljak, Svatopluk; Turzík, Daniel Max-cut in circulant graphs. (English) Zbl 0769.05059 Discrete Math. 108, No. 1-3, 379-392 (1992). MSC: 05C38 05C85 52B05 05C99 68R10 PDF BibTeX XML Cite \textit{S. Poljak} and \textit{D. Turzík}, Discrete Math. 108, No. 1--3, 379--392 (1992; Zbl 0769.05059) Full Text: DOI
Fonlupt, J.; Mahjoub, A. R.; Uhry, J. P. Compositions in the bipartite subgraph polytope. (English) Zbl 0771.05092 Discrete Math. 105, No. 1-3, 73-91 (1992). Reviewer: M.Demlová (Praha) MSC: 05C99 52B12 68Q25 05C70 PDF BibTeX XML Cite \textit{J. Fonlupt} et al., Discrete Math. 105, No. 1--3, 73--91 (1992; Zbl 0771.05092) Full Text: DOI
Poljak, Svatopluk; Tuza, Zsolt Maximum bipartite subgraphs of Kneser graphs. (English) Zbl 0674.05064 Graphs Comb. 3, 191-199 (1987). MSC: 05C99 05A05 PDF BibTeX XML Cite \textit{S. Poljak} and \textit{Z. Tuza}, Graphs Comb. 3, 191--199 (1987; Zbl 0674.05064) Full Text: DOI
Balas, Egon; Pulleyblank, William The perfectly matchable subgraph polytope of a bipartite graph. (English) Zbl 0525.90069 Networks 13, 495-516 (1983). MSC: 90C09 52Bxx 05C70 90B35 90C35 PDF BibTeX XML Cite \textit{E. Balas} and \textit{W. Pulleyblank}, Networks 13, 495--516 (1983; Zbl 0525.90069) Full Text: DOI