Datta, Samir; Kulkarni, Raghav; Limaye, Nutan; Mahajan, Meena Planarity, determinants, permanents, and (unique) matchings. (English) Zbl 1322.05088 ACM Trans. Comput. Theory 1, No. 3, Article No. 10, 20 p. (2010). Cited in 1 ReviewCited in 5 Documents MSC: 05C50 Graphs and linear algebra (matrices, eigenvalues, etc.) 05C10 Planar graphs; geometric and topological aspects of graph theory 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 15A15 Determinants, permanents, traces, other special matrix functions 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 68Q25 Analysis of algorithms and problem complexity Keywords:planarity; bipartite graphs; counting classes; determinant; perfect matching; permanent PDFBibTeX XMLCite \textit{S. Datta} et al., ACM Trans. Comput. Theory 1, No. 3, Article No. 10, 20 p. (2010; Zbl 1322.05088) Full Text: DOI