Polychromatic polynomials

DOI10.1016/S0012-365X(99)00363-5MaRDI QIDQ1567655zbMATH OpenFDO

Authors Béla Bollobás, Oliver Riordan

Publication date 19 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(99)00363-5

zbMATH Keywords

graph invariantchromatic polynomialTutte polynomialpolychromate

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 4091530
• Chromatic polynomials
• scientific article; zbMATH DE number 4128831
• scientific article; zbMATH DE number 1822500
• Generalized chromatic polynomials
• scientific article; zbMATH DE number 4181365
• Chromatic polynomials of hypergraphs
• Chromatic polynomials of hypergraphs
• Chromatic polynomials of mixed hypercycles
• Chromatic polynomials of simplicial complexes

Cited in

(23)

• Weakly distinguishing graph polynomials on addable properties
• A partition of connected graphs
• On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial
• The equivalence of two graph polynomials and a symmetric function
• Polychromatic sets and its application in simulating complex objects and systems
• Planar polynomial of the graphs
• Harary polynomials
• Simultaneous Polaczek polynomials
• The U, V, and W polynomials
• On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
• scientific article; zbMATH DE number 475577 (Why is no real title available?)
• A rooted variant of Stanley's chromatic symmetric function
• The lattice polynomial of a graph.
• Graph polynomials and local graph operations
• scientific article; zbMATH DE number 14020 (Why is no real title available?)
• Tutte polynomials for trees
• On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs
• q-polynomial invariant of rooted trees
• A tree distinguishing polynomial
• Thomas H. Brylawski (1944--2007)
• Polynomial invariants for rooted trees related to their random destruction
• On counting generalized colorings
• On weakly distinguishing graph polynomials

This page was built for publication: Polychromatic polynomials

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