Contraction-deletion invariants for graphs
From MaRDI portal
Publication:1850504
DOI10.1006/JCTB.2000.1988zbMATH Open1024.05028OpenAlexW2001621948MaRDI QIDQ1850504FDOQ1850504
Béla Bollobás, Luke Pebody, Oliver Riordan
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1988
Recommendations
- On graph invariants satisfying the deletion-contraction formula
- Deletion and contraction in configuration spaces of graphs
- INVARIANTS OF GRAPHS
- Contractions in persistence and metric graphs
- Contractibility and the clique graph operator
- On a contraction-like property of dismantlable graphs
- scientific article; zbMATH DE number 3904629
- Homomorphisms and related contractions of graphs
- Edge deletion and invariance in graphs using \(D\)-distance
- Finite-type invariants for graphs and graph reconstructions
Cites Work
- Intersection theory for graphs
- A weighted graph polynomial from chromatic invariants of knots
- A Contribution to the Theory of Chromatic Polynomials
- Title not available (Why is that?)
- State models and the Jones polynomial
- A Tutte polynomial for signed graphs
- A spanning tree expansion of the Jones polynomial
- Polynomial Invariants of Graphs
- A Tutte Polynomial for Coloured Graphs
- On chromatic equivalence of graphs
- Generalized activities and the Tutte polynomial
- Title not available (Why is that?)
- Title not available (Why is that?)
- The search for chromatically unique graphs
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- The search for chromatically unique graphs. II
- Codichromatic graphs
- A note on Nagami's polynomial invariants for graphs
Cited In (32)
- Weakly distinguishing graph polynomials on addable properties
- Combinatorial anti-concentration inequalities, with applications
- A Note on Jacobians, Tutte Polynomials, and Two-Variable Zeta Functions of Graphs
- Tutte polynomial, complete invariant, and theta series
- New Graph Polynomials from the Bethe Approximation of the Ising Partition Function
- Short certificates for chromatic equivalence
- Graphs determined by polynomial invariants
- Friends and strangers walking on graphs
- Triangles in random graphs
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- Constructing cospectral graphs via a new form of graph product
- Contractors and connectors of graph algebras
- GlobaL analysis of the deiete-contract recursion for graphs and matroids
- Title not available (Why is that?)
- On graphs determined by their Tutte polynomials
- On Tutte polynomial uniqueness of twisted wheels
- On P-unique hypergraphs
- Distinguishing graphs by their left and right homomorphism profiles
- On matroids determined by their Tutte polynomials
- Factorisation of greedoid polynomials of rooted digraphs
- The drop polynomial of a weighted digraph
- A deletion-contraction algorithm for the characteristic polynomial of a multigraph
- Homomorphisms and polynomial invariants of graphs
- A note on graphs of \(k\)-colourings
- Title not available (Why is that?)
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function
- The bivariate Ising polynomial of a graph
- Effective fluctuation and response theory
- Title not available (Why is that?)
- Troupes, cumulants, and stack-sorting
- Homomorphisms and Polynomial Invariants of Graphs
- The Tutte polynomial for graphs
This page was built for publication: Contraction-deletion invariants for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850504)
