Pages that link to "Item:Q4680728"

The following pages link to On the number of dissimilar pfaffian orientations of graphs (Q4680728):

Displaying 11 items.

• Minimally non-Pfaffian graphs (Q947729) (← links)
• Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672) (← links)
• On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration (Q1277144) (← links)
• An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
• A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
• On the Pfaffian number of graphs (Q2840532) (← links)
• Even cycles and perfect matchings in claw-free plane graphs (Q3386627) (← links)
• A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547) (← links)
• Operations preserving the Pfaffian property of a graph (Q3978111) (← links)
• Even Orientations and Pfaffian graphs (Q5087677) (← links)
• Removable and forced subgraphs of graphs (Q6495257) (← links)