scientific article; zbMATH DE number 3517179

zbMATH Open0331.05103MaRDI QIDQ4097310FDOQ4097310

Authors: C. H. C. Little 

Publication date: 1974

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (17)

• The parity of a thicket
• Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
• The combinatorics of N. G. de Bruijn
• Matching theory -- a sampler: From Dénes König to the present
• Almost exact matchings
• Counting the number of perfect matchings, and generalized decision trees
• Pfaffian orientations for a type of bipartite graph
• The combinatorial approach yields an NC algorithm for computing Pfaffians
• Sign-nonsingular skew-symmetric matrices
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• Title not available (Why is that?)
• Counting the number of perfect matchings in \(K_{5}\)-free graphs
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
• Title not available (Why is that?)
• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
• Strong orientations without even directed circuits

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)