4 problems
- 0 votes0 replies1 view
Characterization of separating cuts preserving the pfaffian number
Let a separating cut be a cut in a matchable graph whose contraction produces a graph, and let denote the pfaffian number of a graph . Separating-cut pres…
- 0 votes0 replies0 views
Strict conformal-subgraph lower bound for the pfaffian number
Let be a matchable graph. Let be a non-spanning conformal subgraph of and let . Strict conformal-subgraph lower-bound conjecture. If and are…
- 0 votes0 replies0 views
The solid Pfaffian graph matching-colouring conjecture
Solid Pfaffian conjecture.
- 0 votes0 replies1 view
Norine–Thomas conjecture on 3-edge-colorability of Pfaffian cubic graphs
Norine–Thomas conjecture. Every Pfaffian cubic graph is 3-edge colorable.