scientific article; zbMATH DE number 2038883

MaRDI QIDQ4449286zbMATH OpenFDO

Authors Klaus Dohmen, André Pönitz, Peter Tittmann

Publication date 8 February 2004

Full work available at URL https://eudml.org/doc/123458, http://www.emis.de/journals/DMTCS/volumes/abstracts/dm060106.abs.html

zbMATH Keywords

pathwidthchromatic polynomialset partitionchromatic symmetric functionbroken circuit

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A class of new two-variable chromatic polynomials
• The two-variable chromatic polynomial of regular tree study
• An extension of the bivariate chromatic polynomial
• scientific article; zbMATH DE number 4081583
• Comparisons of some classes of two-variable chromatic polynomials

Cited in

(32)

• Weakly distinguishing graph polynomials on addable properties
• Independence polynomials of circulants with an application to music
• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
• INDUCED CYCLE POLYNOMIAL OF A GRAPH
• On the reconstruction of graph invariants
• Bivariate order polynomials
• The two-variable chromatic polynomial of regular tree study
• On the differential polynomial of a graph
• An extension of the bivariate chromatic polynomial
• Inclusion-exclusion by ordering-free cancellation
• A Most General Edge Elimination Polynomial
• POLYNOMIAL REPRESENTATIONS OF THE BICLIQUE NEIGHBORHOOD OF GRAPHS
• scientific article; zbMATH DE number 475577 (Why is no real title available?)
• Distinguishing graphs by their left and right homomorphism profiles
• Comparisons of some classes of two-variable chromatic polynomials
• An abstraction of Whitney's broken circuit theorem
• scientific article; zbMATH DE number 4156470 (Why is no real title available?)
• The enumeration of vertex induced subgraphs with respect to the number of components
• A bijection for the Boolean numbers of Ferrers graphs
• New expressions for order polynomials and chromatic polynomials
• A broken cycle theorem for the restrained chromatic function
• Polynomial graph invariants from homomorphism numbers
• The universal edge elimination polynomial and the dichromatic polynomial
• On the roots of independence polynomials of almost all very well-covered graphs
• A bivariate chromatic polynomial for signed graphs
• Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function
• Bivariate chromatic polynomials in computer algebra
• Generalized chromatic polynomials
• A class of new two-variable chromatic polynomials
• Independence roots and independence fractals of certain graphs
• On counting generalized colorings
• Alliance polynomial of regular graphs

This page was built for publication:

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