scientific article; zbMATH DE number 3517179
From MaRDI portal
Publication:4097310
zbMath0331.05103MaRDI QIDQ4097310
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (17)
The combinatorial approach yields an NC algorithm for computing Pfaffians ⋮ Sign-nonsingular skew-symmetric matrices ⋮ NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems ⋮ The parity of a thicket ⋮ Almost exact matchings ⋮ Unnamed Item ⋮ Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs ⋮ Pfaffian orientations for a type of bipartite graph ⋮ Counting the number of perfect matchings in \(K_{5}\)-free graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Unnamed Item ⋮ Counting the number of perfect matchings, and generalized decision trees ⋮ The combinatorics of N. G. de Bruijn ⋮ Pfaffian pairs and parities: counting on linear matroid intersection and parity problems ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs ⋮ Strong orientations without even directed circuits ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
This page was built for publication:
