The Pfaffian property of Cartesian products of graphs
From MaRDI portal
Publication:2015792
DOI10.1007/S10878-012-9533-4zbMATH Open1322.90078OpenAlexW2048821669MaRDI QIDQ2015792FDOQ2015792
Authors: Fuliang Lu, Lianzhu Zhang 
Publication date: 24 June 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9533-4
Recommendations
Cites Work
- Matching theory
- A characterization of convertible (0,1)-matrices
- Permanents, Pfaffian orientations, and even directed circuits
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Title not available (Why is that?)
- Even circuits of prescribed clockwise parity
- Minimally non-Pfaffian graphs
- A characterisation of Pfaffian near bipartite graphs
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- Title not available (Why is that?)
- Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Title not available (Why is that?)
Cited In (10)
- GRAPH PRODUCTS AND THE ABSENCE OF PROPERTY (AR)
- A quasicancellation property for the direct product of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Pfaffian property of Cayley graphs on dihedral groups
- The Pfaffian property of circulant graphs
- A sufficient condition for Pfaffian graphs on the torus
- A conjecture of Norine and Thomas for abelian Cayley graphs
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
- Enumeration of perfect matchings of the Cartesian products of graphs
This page was built for publication: The Pfaffian property of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015792)
