Pages that link to "Item:Q3503547"
From MaRDI portal
The following pages link to A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547):
Displaying 7 items.
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672) (← links)
- Towards a characterisation of Pfaffian near bipartite graphs (Q1349098) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- A conjecture of Norine and Thomas for abelian Cayley graphs (Q2409829) (← links)
- Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs (Q2907957) (← links)