The Equivalence of Two Graph Polynomials and a Symmetric Function (Q3552515): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q221681 / rank
Normal rank
 
Property / author
 
Property / author: Steven D. Noble / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0805.4793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetric function generalization of the chromatic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correlation inequality involving stable set and chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polychromate and a chord diagram polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weighted graph polynomial from chromatic invariants of knots / rank
 
Normal rank
Property / cites work
 
Property / cites work: From a zoo to a zoology: Towards a general theory of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theory for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 17:59, 2 July 2024

scientific article
Language Label Description Also known as
English
The Equivalence of Two Graph Polynomials and a Symmetric Function
scientific article

    Statements