scientific article; zbMATH DE number 1559555

zbMATH Open0963.68153MaRDI QIDQ4527007FDOQ4527007

Authors: Neil Robertson, Robin Thomas, William McCuaig, Paul Seymour 

Publication date: 28 February 2001

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

Recommendations

• Permanents, Pfaffian orientations, and even directed circuits
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• scientific article; zbMATH DE number 4058868
• A survey of Pfaffian orientations of graphs
• Pólya's permanent problem

zbMATH Keywords

bipartite graphsPfaffian orientations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (25)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• On the (di)graphs with (directed) proper connection number two
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• Generating bricks
• Dimers on the \(3^3 . 4^2\) lattice
• 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
• Permanents, Pfaffian orientations, and even directed circuits
• Computation of sparse circulant permanents via determinants
• Oriented Euler complexes and signed perfect matchings
• Replacing Pfaffians and applications
• On the linear classification of even and odd permutation matrices and the complexity of computing the permanent
• Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
• On the rank of a real skew symmetric matrix described by an oriented graph
• A theory of even functionals and their algorithmic applications
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• A quadratic identity for the number of perfect matchings of plane graphs
• Removable and forced subgraphs of graphs
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Cache me if you can: capacitated selfish replication games in networks
• On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
• Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
• The Pfaffian property of Cartesian products of graphs
• Note on alternating directed cycles

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 Q4527007)