A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs

Michel Las Vergnas. A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs. Electronic Notes in Discrete Mathematics, 31:119-122, 2008. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.