Login / Signup
A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs.
Michel Las Vergnas
Published in:
Electron. Notes Discret. Math. (2008)
Keyphrases
</>
computational complexity
planar graphs
np hard
probability distribution