A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs
From MaRDI portal
Publication:5300994
DOI10.1016/j.endm.2008.06.024zbMath1267.05102OpenAlexW2068498245WikidataQ123133877 ScholiaQ123133877MaRDI QIDQ5300994
Could not fetch data.
Publication date: 28 June 2013
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.024
Could not fetch data.