A new proof of a characterisation of Pfaffian bipartite graphs

DOI10.1016/j.jctb.2003.10.004zbMath1042.05086OpenAlexW1997984839MaRDI QIDQ1826958

Kee L. Teo, Serguei Norine, Charles H. C. Little

Publication date: 6 August 2004

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.2003.10.004

zbMATH Keywords

Bipartite graphsPfaffian graphs1-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem

Cites Work

• Unnamed Item
• Characterization of even directed graphs
• Matching theory
• Towards a characterisation of Pfaffian near bipartite graphs
• A characterization of convertible (0,1)-matrices
• A characterisation of Pfaffian near bipartite graphs
• Permanents, Pfaffian orientations, and even directed circuits

This page was built for publication: A new proof of a characterisation of Pfaffian bipartite graphs