The Tutte Polynomial Characterizes Simple Outerplanar Graphs

DOI10.1017/S0963548311000113zbMath1223.05126OpenAlexW2121374497MaRDI QIDQ5199509

Marc Noy, Andrew J. Goodall, Anna de Mier, Steven D. Noble

Publication date: 16 August 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000113

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items (1)

Broken circuit complexes of series-parallel networks

Cites Work

• Being Hamiltonian is not a Tutte invariant
• Parallel recognition of series-parallel graphs
• Irreducibility of the Tutte polynomial of a connected matroid
• Enumeration and limit laws for series-parallel graphs
• On matroids determined by their Tutte polynomials
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: The Tutte Polynomial Characterizes Simple Outerplanar Graphs