Graphs determined by polynomial invariants
From MaRDI portal
Publication:1885023
DOI10.1016/S0304-3975(03)00225-1zbMath1048.05072MaRDI QIDQ1885023
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
On the bivariate permanent polynomials of graphs, On the spectral characterization of T-shape trees, Jones Representations of Thompson’s GroupFArising from Temperley–Lieb–Jones Algebras, Graphs with few matching roots, On sequences of polynomials arising from graph invariants, On the spectral characterization of the union of complete multipartite graph and some isolated vertices, Note on the subgraph component polynomial, A computational approach to construct a multivariate complete graph invariant, Weakly distinguishing graph polynomials on addable properties, The enumeration of vertex induced subgraphs with respect to the number of components, Distinguishing graphs by their left and right homomorphism profiles, On the differential polynomial of a graph, On chromatic and flow polynomial unique graphs, Toric varieties from cyclic matrix semigroups, The bivariate Ising polynomial of a graph, On P-unique hypergraphs, Generalized permanental polynomials of graphs, Homomorphisms and polynomial invariants of graphs, Characterizing properties of permanental polynomials of lollipop graphs, Delta invariant for Eulerian digraphs
Cites Work
- The complexity of computing the permanent
- Curious characterizations of projective and affine geometries
- The search for chromatically unique graphs
- Intersection theory for graphs
- Connections between the matching and chromatic polynomials
- A weighted graph polynomial from chromatic invariants of knots
- The matching polynomial of a regular graph
- The search for chromatically unique graphs. II
- The list of chromatically unique graphs of order seven and eight
- T-uniqueness of some families of \(k\)-chordal matroids
- The polychromate and a chord diagram polynomial
- A symmetric function generalization of the chromatic polynomial of a graph
- Locally grid graphs: Classification and Tutte uniqueness
- Contraction-deletion invariants for graphs
- Irreducibility of the Tutte polynomial of a connected matroid
- On graphs determined by their Tutte polynomials
- Characterizing combinatorial geometries by numerical invariants
- Codichromatic graphs
- Strongly inequivalent representations and Tutte polynomials of matroids
- Theory of monomer-dimer systems
- Tutte uniqueness of line graphs
- On matroids determined by their Tutte polynomials
- A Polynomial Invariant of Graphs On Orientable Surfaces
- The chromaticity of complete bipartite graphs with at most one edge deleted
- Chromaticity of two-trees
- On chromatic equivalence of graphs
- A Tutte Polynomial for Coloured Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- A Contribution to the Theory of Chromatic Polynomials
- A new 5‐arc‐transitive cubic graph
- Large families of cospectral graphs
- Acyclic orientations and the chromatic polynomial
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
