Towards a characterisation of Pfaffian near bipartite graphs

DOI10.1016/S0012-365X(01)00060-7zbMath0997.05084DBLPjournals/dm/LittleRF02arXivmath/9909026OpenAlexW2011916756WikidataQ59196594 ScholiaQ59196594MaRDI QIDQ1349098

Charles H. C. Little, Ilse Fischer, Franz Rendl

Publication date: 21 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

1-factorear decomposition1-extendible

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 (6)

Dimers on the \(3^3 . 4^2\) lattice ⋮ Pfaffian orientations for a type of bipartite graph ⋮ Minimally non-Pfaffian graphs ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ A new proof of a characterisation of Pfaffian bipartite graphs ⋮ A characterisation of Pfaffian near bipartite graphs

This page was built for publication: Towards a characterisation of Pfaffian near bipartite graphs