Recognizing near-bipartite Pfaffian graphs in polynomial time
From MaRDI portal
(Redirected from Publication:987672)
Recommendations
Cites work
Cited in
(9)- Towards a characterisation of Pfaffian near bipartite graphs
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
- A characterisation of Pfaffian near bipartite graphs
- Recognizing generalized Petersen graphs in linear time
- Bipartite double cover and perfect 2-matching covered graph with its algorithm
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
- Efficiently recognizing the P₄-structure of trees and of bipartite graphs without short cycles
- A note on cyclic connectivity and matching properties of regular graphs
- Minimally non-Pfaffian graphs
This page was built for publication: Recognizing near-bipartite Pfaffian graphs in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987672)