Mathematics – Combinatorics
Scientific paper
1999-09-03
Mathematics
Combinatorics
added references
Scientific paper
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.
Fischer Ilse
Little Charles H. C.
Rendl Franz
No associations
LandOfFree
Towards a characterisation of Pfaffian graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Towards a characterisation of Pfaffian graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards a characterisation of Pfaffian graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-543278