Pfaffian orientations for a type of bipartite graph
DOI10.1016/J.TCS.2014.01.030zbMATH Open1283.05220OpenAlexW2061749699MaRDI QIDQ2437778FDOQ2437778
Fuliang Lu, Lianzhu Zhang, Feng-Gen Lin
Publication date: 13 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.030
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
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
- Matching structure and the matching lattice
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- A characterisation of Pfaffian near bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a characterisation of Pfaffian near bipartite graphs
Cited In (8)
- Title not available (Why is that?)
- A survey of Pfaffian orientations of graphs
- Bipartite graphs obtained from adjacency matrices of orientations of graphs
- Oriented bipartite graphs and the Goldbach graph
- Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
- Even Orientations and Pfaffian graphs
- On the number of dissimilar pfaffian orientations of graphs
This page was built for publication: Pfaffian orientations for a type of bipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437778)
