Pages that link to "Item:Q987672"

The following pages link to Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672):

Displaying 10 items.

• Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
• A note on cyclic connectivity and matching properties of regular graphs (Q742609) (← links)
• Minimally non-Pfaffian graphs (Q947729) (← links)
• Towards a characterisation of Pfaffian near bipartite graphs (Q1349098) (← links)
• An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
• A characterisation of Pfaffian near bipartite graphs (Q1850543) (← links)
• Recognizing generalized Petersen graphs in linear time (Q2192132) (← links)
• Bipartite double cover and perfect 2-matching covered graph with its algorithm (Q2355652) (← links)
• A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547) (← links)
• Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles (Q5935599) (← links)