Formulas for the computation of the Tutte polynomial of graphs with parallel classes

DOI10.5614/EJGTA.2018.6.1.8MaRDI QIDQ5009972zbMATH OpenOpenAlexWikidataFDO

Authors Eunice Mphako-Banda, Julian A. Allagan

Publication date 23 August 2021

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.5614/ejgta.2018.6.1.8

zbMATH Keywords

minorsparallel classTutte polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The Tutte polynomial of a class of compound graphs and its applications
• The Tutte polynomial for graphs
• Parametrized Tutte Polynomials of Graphs and Matroids
• Computing the Tutte polynomial of a graph of moderate size
• A general method for computing Tutte polynomials of self-similar graphs
• Tutte polynomial of some multigraphs
• On graphs determined by their Tutte polynomials
• A version of Tutte's polynomial for hypergraphs
• Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width
• Graph-Theoretic Concepts in Computer Science

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• Series and parallel reductions for the Tutte polynomial
• Splitting formulas for Tutte polynomials

Cited in

(2)

• A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs
• On some formulas in combinatorial computation of uni-trivalent graphs

This page was built for publication: Formulas for the computation of the Tutte polynomial of graphs with parallel classes

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