A generalization of Little's theorem on Pfaffian orientations

DOI10.1016/j.jctb.2012.07.004zbMath1256.05185OpenAlexW2029943728MaRDI QIDQ1931399

U. S. R. Murty, Cláudio Leonardo Lucchesi, Marcelo H. De Carvalho

Publication date: 14 January 2013

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2012.07.004

zbMATH Keywords

perfect matchingsmatching covered graphsPfaffian orientationssolid matching covered graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

On cycle-nice claw-free graphs ⋮ On Two Unsolved Problems Concerning Matching Covered Graphs ⋮ A conjecture of Norine and Thomas for abelian Cayley graphs ⋮ Matching covered graphs with three removable classes ⋮ Removable edges in Halin graphs ⋮ The Pfaffian property of Cayley graphs on dihedral groups ⋮ The cubic vertices of solid minimal bricks ⋮ On essentially 4-edge-connected cubic bricks ⋮ \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks ⋮ Relations between global forcing number and maximum anti-forcing number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• The perfect matching polytope and solid bricks
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
• Minimally non-Pfaffian graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Pólya's permanent problem
• 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
• How to build a brick
• Generating bricks
• Graphs with independent perfect matchings
• A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
• On the number of dissimilar pfaffian orientations of graphs
• The Factorization of Linear Graphs

This page was built for publication: A generalization of Little's theorem on Pfaffian orientations