Graphs determined by polynomial invariants (Q1885023): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2741172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matching polynomial of a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new 5‐arc‐transitive cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction-deletion invariants for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutte Polynomial for Coloured Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Invariant of Graphs On Orientable Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly inequivalent representations and Tutte polynomials of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: T-uniqueness of some families of \(k\)-chordal matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing combinatorial geometries by numerical invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theory for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic equivalence of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems of Paul Erd�s in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections between the matching and chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for chromatically unique graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Curious characterizations of projective and affine geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations and the chromatic polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list of chromatically unique graphs of order seven and eight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally grid graphs: Classification and Tutte uniqueness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility of the Tutte polynomial of a connected matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs determined by their Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroids determined by their Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte uniqueness of line graphs / 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: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3819084 / 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: Q5676231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large families of cospectral graphs / 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: The chromaticity of complete bipartite graphs with at most one edge deleted / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codichromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromaticity of two-trees / rank
 
Normal rank

Latest revision as of 14:53, 7 June 2024

scientific article
Language Label Description Also known as
English
Graphs determined by polynomial invariants
scientific article

    Statements

    Graphs determined by polynomial invariants (English)
    0 references
    0 references
    27 October 2004
    0 references
    Graph invariant
    0 references
    Tutte polynomial
    0 references
    Chromatic polynomial
    0 references
    Matroid
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers