The Tutte polynomial characterizes simple outerplanar graphs

MaRDI QIDQ2857420zbMATH OpenFDO

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

Publication date 1 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065311001739

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph polynomials (05C31)

Recommendations

• The Tutte polynomial characterizes simple outerplanar graphs
• Chromatic polynomials, polygon trees, and outerplanar graphs
• On graphs determined by their Tutte polynomials
• Tutte uniqueness and Tutte equivalence
• On the Tutte polynomial of benzenoid chains

Cites work

• A Combinatorial Model for Series-Parallel Networks
• A Decomposition for Combinatorial Geometries
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Being Hamiltonian is not a Tutte invariant
• Enumeration and limit laws for series-parallel graphs
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Irreducibility of the Tutte polynomial of a connected matroid
• Lattice path matroids: Enumerative aspects and Tutte polynomials
• On matroids determined by their Tutte polynomials
• Parallel recognition of series-parallel graphs

Cited in

(1)

• The Tutte polynomial characterizes simple outerplanar graphs

This page was built for publication: The Tutte polynomial characterizes simple outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857420)