A characterisation of Pfaffian near bipartite graphs

Simple item page
dc.creatorFischer, Ilse
dc.creatorLittle, C. H. C.
dc.date2000-02-09
dc.date.accessioned2026-07-07T04:33:38Z
dc.date.available2026-07-07T04:33:38Z
dc.descriptionIn 1967 Kasteleyn introduced a powerful method for enumerating the 1-factors of planar graphs. In fact his method can be extended to graphs which permit an orientation under which every alternating circuit is clockwise odd. Graphs with this property are called {\it Pfaffian}. Little characterised Pfaffian bipartite graphs in terms of forbidden subgraphs in 1975. We extend his characterisation to near bipartite graphs.
dc.identifierhttps://arxiv.org/abs/math/0002062
dc.identifierhttp://arxiv.org/abs/math/0002062
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/58653
dc.subjectCombinatorics
dc.titleA characterisation of Pfaffian near bipartite graphs
dc.typetext

Files

Collections

arXiv