On the number of dissimilar pfaffian orientations of graphs
From MaRDI portal
Publication:4680728
DOI10.1051/ita:2005005zbMath1069.05066OpenAlexW2017063915MaRDI QIDQ4680728
Marcelo H. De Carvalho, U. S. R. Murty, Cláudio Leonardo Lucchesi
Publication date: 7 June 2005
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_1_93_0
Related Items
A generalization of Little's theorem on Pfaffian orientations ⋮ Even cycles and perfect matchings in claw-free plane graphs ⋮ A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs ⋮ An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs ⋮ Recognizing near-bipartite Pfaffian graphs in polynomial time
Cites Work
- Unnamed Item
- Unnamed Item
- The perfect matching polytope and solid bricks
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Brick decompositions and the matching rank of graphs
- Matching theory
- Matching structure and the matching lattice
- Ear decompositions of matching covered graphs
- A characterization of convertible (0,1)-matrices
- A characterisation of Pfaffian near bipartite graphs
- Optimal ear decompositions of matching covered graphs and bases for the matching lattice
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
- Permanents, Pfaffian orientations, and even directed circuits
- Brace generation
