Abstract
If a graph G is Pfaffian, then the number of perfect matchings of G can be computed in polynomial time. So it makes sense to test whether a graph is Pfaffian. Historically in organic chemistry and combinatorial mathematics, polyominos have attracted the most attention. In this paper, we characterize all Pfaffian polyominos on the Klein bottle.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
