Abstract
Which graphs admit a Pfaffian orientation? This is a significant and interesting problem in matching theory because the number of perfect matchings of a graph can be computed in polynomial time if it admits a Pfaffian orientation. In this paper, we completely characterize the Pfaffian property of Cayley graphs on dihedral groups.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
