How I got to like graph polynomials
From MaRDI portal
Publication:6593617
DOI10.2140/MT.2024.3.465MaRDI QIDQ6593617
Publication date: 27 August 2024
Published in: Model Theory (Search for Journal in Brave)
Graph polynomials (05C31) Model theory of finite structures (03C13) Categoricity and completeness of theories (03C35) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strongly polynomial sequences as interpretations
- Fundamentals of parameterized complexity
- Algorithmic uses of the Feferman-Vaught theorem
- The complexity of computing the permanent
- Distinguishing graphs by their left and right homomorphism profiles
- Spectra of graphs
- Stability in generic mitochondrial models
- Polynomial graph invariants from homomorphism numbers
- From a zoo to a zoology: Towards a general theory of graph polynomials
- An extension of the bivariate chromatic polynomial
- \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures
- Example of an \(omega_ 1-\)categorical complete finitely axiomatizable theory
- On the size of hereditary classes of graphs
- On the algebraic complexity of some families of coloured Tutte polynomials
- Completeness and reduction in algebraic complexity theory
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- The speed of hereditary properties of graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- Jumps in speeds of hereditary properties in finite relational languages
- Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- On Counting Generalized Colorings
- On generalized graph colorings
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- On the computational complexity of the Jones and Tutte polynomials
- On some conjectures connected with complete sentences
- Two Algorithmic Results for the Traveling Salesman Problem
- Harary polynomials
- Flag algebras
- Categoricity in Power
- Logical Approaches to Computational Barriers
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
This page was built for publication: How I got to like graph polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593617)
