Evaluations of Graph Polynomials (Q5302054): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The interlace polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multivariate interlace polynomial and its computation for graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of harmonious colouring for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection positivity, rank connectivity, and homomorphism of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new evaluations of the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, Eulerian subgraphs and the Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank

Latest revision as of 23:22, 28 June 2024

scientific article; zbMATH DE number 5494795
Language Label Description Also known as
English
Evaluations of Graph Polynomials
scientific article; zbMATH DE number 5494795

    Statements

    Evaluations of Graph Polynomials (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2009
    0 references
    Tutte polynomial
    0 references
    interlace polynomial
    0 references
    connection matrix
    0 references
    graph parameter
    0 references
    monadic second order logic
    0 references
    graph polynomials
    0 references

    Identifiers