GlobaL analysis of the deiete-contract recursion for graphs and matroids

DOI10.1080/03081088408817584MaRDI QIDQ3320394zbMATH OpenOpenAlexFDO

Authors Edward A. Bender, Xavier Viennot, S. Gill Williamson

Publication date 1984

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081088408817584

zbMATH Keywords

contractiondeletionchromatic polynomialTutte polynomialTutte-Grothendieck invariantbinary ordered tree

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• The complexity of deletion problems for matroids
• Deletion and contraction in configuration spaces of graphs
• Contraction-deletion invariants for graphs
• On graph invariants satisfying the deletion-contraction formula
• Approximating Node-Deletion Problems for Matroidal Properties
• A deletion-contraction algorithm for the characteristic polynomial of a multigraph
• Parameterized algorithms for deletion to \((r,\ell)\)-graphs
• Deterministic Dcomposition of Recursive Graph Classes
• Applications of the Wold decomposition to the study of row contractions associated with directed graphs
• Parameterized complexity of vertex deletion into perfect graph classes

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• A logical expansion in mathematics
• Algebraic Graph Theory
• Graph theory and statistical physics
• On dichromatic polynomials

Cited in

(1)

• Deletion-contraction to form a polymatroid

This page was built for publication: GlobaL analysis of the deiete-contract recursion for graphs and matroids

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