Harary polynomials

DOI10.54550/ECA2021V1S2R13zbMath1499.05310arXiv2003.06250OpenAlexW3011654547MaRDI QIDQ5056203

Vsevolod Rakita, Orli Herscovici, Johann A. Makowsky

Publication date: 7 December 2022

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.06250

zbMATH Keywords

graph polynomialsgeneralized coloringsCourcelle's theorem

Mathematics Subject Classification ID

Graph polynomials (05C31) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Sparsity. Graphs, structures, and algorithms
• The covered components polynomial: a new representation of the edge elimination polynomial
• Recurrence relations and splitting formulas for the domination polynomial
• Counting connected set partitions of graphs
• On the complexity of generalized chromatic polynomials
• An extension of the bivariate chromatic polynomial
• The complexity of \(G\)-free colourability
• A new method for proving chromatic uniqueness of graphs
• FPT algorithms for domination in sparse graphs and beyond
• Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
• Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
• The complexity of generalized graph colorings
• Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
• A logician's view of graph polynomials
• One more remark on the adjoint polynomial
• Parametrized complexity theory.
• Structural sparsity
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• Connection Matrices and the Definability of Graph Parameters
• Introduction to Random Graphs
• Model Theoretic Methods in Finite Combinatorics
• A Course in Enumeration
• Graph coloring with no large monochromatic components
• Computing Graph Polynomials on Graphs of Bounded Clique-Width
• Hard Enumeration Problems in Geometry and Combinatorics
• On generalized graph colorings
• Mean value for the matching and dominating polynomial
• A Most General Edge Elimination Polynomial
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• On a problem of K. Zarankiewicz
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic