Towards a characterisation of Pfaffian graphs
| dc.creator | Little, Charles H. C. | |
| dc.creator | Rendl, Franz | |
| dc.creator | Fischer, Ilse | |
| dc.date | 1999-09-03 | |
| dc.date | 1999-09-06 | |
| dc.date.accessioned | 2026-07-07T05:30:39Z | |
| dc.date.available | 2026-07-07T05:30:39Z | |
| dc.description | A bipartite graph G is known to be Pfaffian if and only if it does not contain an even subdivision H of $K_{3,3}$ such that $G - VH$ contains a 1-factor. However a general characterisation of Pfaffian graphs in terms of forbidden subgraphs is currently not known. In this paper we describe a possible approach to the derivation of such a characterisation. We also extend the characterisation for bipartite graphs to a slightly more general class of graphs. | |
| dc.description | added references | |
| dc.identifier | https://arxiv.org/abs/math/9909026 | |
| dc.identifier | http://arxiv.org/abs/math/9909026 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79061 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C70 | |
| dc.title | Towards a characterisation of Pfaffian graphs | |
| dc.type | text |