Poljak, Svatopluk; Turzik, Daniel A polynomial algorithm for constructing a large bipartite subgraphs, with an application to a satisfiability problem. (English) Zbl 0471.68041 Can. J. Math. 34, 519-524 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 12 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 68Q25 Analysis of algorithms and problem complexity 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010) Keywords:Boolean expressions in conjunctive form PDF BibTeX XML Cite \textit{S. Poljak} and \textit{D. Turzik}, Can. J. Math. 34, 519--524 (1982; Zbl 0471.68041) Full Text: DOI