Odd \(K_{3,3}\) subdivisions in bipartite graphs

DOI10.1016/J.JCTB.2016.01.005zbMath1332.05116arXiv1309.5336OpenAlexW2962719609MaRDI QIDQ256986

Peter Whalen, Robin Thomas

Publication date: 14 March 2016

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

Full work available at URL: https://arxiv.org/abs/1309.5336

zbMATH Keywords

bipartite graphPfaffian orientationodd \(K_{3, 3}\) subdivision

Mathematics Subject Classification ID

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

Related Items (1)

Counting the number of perfect matchings, and generalized decision trees

Cites Work

• The complexity of computing the permanent
• Pólya's permanent problem
• A characterization of convertible (0,1)-matrices
• Permanents, Pfaffian orientations, and even directed circuits
• The statistics of dimers on a lattice
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Odd \(K_{3,3}\) subdivisions in bipartite graphs