On distinguishing trees by their chromatic symmetric functions (Q2474494): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theory for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte polynomials for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-isomorphic caterpillars with identical subtree data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brick tabloids and the connection matrices between bases of symmetric functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A chromatic symmetric function in noncommuting variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with the same degree sequence and path numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reconstruction of a Tree from its Maximal Subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / 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: HOW TO COUNT TREES? / 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 symmetric function generalization of the chromatic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank

Latest revision as of 17:28, 27 June 2024

scientific article
Language Label Description Also known as
English
On distinguishing trees by their chromatic symmetric functions
scientific article

    Statements

    Identifiers