scientific article; zbMATH DE number 3517179

MaRDI QIDQ4097310zbMATHFDO

Authors C. H. C. Little

Publication date 1974

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)

Cited in

(17)

• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• Strong orientations without even directed circuits
• scientific article; zbMATH DE number 7561373 (Why is no real title available?)
• Counting the number of perfect matchings, and generalized decision trees
• Pfaffian orientations for a type of bipartite graph
• Sign-nonsingular skew-symmetric matrices
• The parity of a thicket
• The combinatorics of N. G. de Bruijn
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• Counting problems in parameterized complexity
• Matching theory -- a sampler: From Dénes König to the present
• Almost exact matchings
• Counting the number of perfect matchings in \(K_{5}\)-free graphs
• The combinatorial approach yields an NC algorithm for computing Pfaffians

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4097310)