×

Found 6 Documents (Results 1–6)

Finding an odd \(K_{3,3}\). (English) Zbl 1293.05142

Nešetřil, Jaroslav (ed.) et al., The seventh European conference on combinatorics, graph theory and applications. Extended abstracts of EuroComb 2013, Pisa, Italy, September 9–13, 2013. Pisa: Edizioni della Normale (ISBN 978-88-7642-474-8/pbk; 978-88-7642-475-5/ebook). Centro di Ricerca Matematica Ennio De Giorgi (CRM) Series 16, 153-156 (2013).
MSC:  05C20 05C70 05C60
PDFBibTeX XMLCite

A polynomial time algorithm for recognizing near-bipartite Pfaffian graphs. (English) Zbl 1341.05213

Liebling, Th. (ed.) et al., The IV Latin-American algorithms, graphs, and optimization symposium, Puerto Varas, Chile, November 25–29, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 30, 171-176 (2008).
MSC:  05C70 05C85 05C40
PDFBibTeX XMLCite
Full Text: DOI

Polynomial time SAT decision for complementation-invariant clause-sets, and sign-non-singular matrices. (English) Zbl 1214.68360

Marques-Silva, João (ed.) et al., Theory and applications of satisfiability testing – SAT 2007. 10th international conference, Lisbon, Portugal, May 28–31, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72787-3/pbk). Lecture Notes in Computer Science 4501, 314-327 (2007).
MSC:  68T20 05C65 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field