scientific article; zbMATH DE number 2038883
From MaRDI portal
Publication:4449286
zbMath1035.68078MaRDI QIDQ4449286
Peter Tittmann, André Pönitz, Klaus Dohmen
Publication date: 8 February 2004
Full work available at URL: https://eudml.org/doc/123458
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Inclusion-exclusion by ordering-free cancellation ⋮ A Most General Edge Elimination Polynomial ⋮ Bivariate order polynomials ⋮ INDUCED CYCLE POLYNOMIAL OF A GRAPH ⋮ POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS ⋮ Polynomial graph invariants from homomorphism numbers ⋮ Weakly distinguishing graph polynomials on addable properties ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ An abstraction of Whitney's broken circuit theorem ⋮ Bivariate chromatic polynomials in computer algebra ⋮ On the differential polynomial of a graph ⋮ A bivariate chromatic polynomial for signed graphs ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Alliance polynomial of regular graphs ⋮ Independence roots and independence fractals of certain graphs ⋮ A broken cycle theorem for the restrained chromatic function ⋮ Unnamed Item ⋮ Independence polynomials of circulants with an application to music ⋮ A bijection for the Boolean numbers of Ferrers graphs ⋮ An extension of the bivariate chromatic polynomial ⋮ Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function ⋮ On the reconstruction of graph invariants
This page was built for publication: