On Counting Generalized Colorings

DOI10.1007/978-3-540-87531-4_25zbMath1157.05024OpenAlexW1525035754MaRDI QIDQ3540189

B. I. Zil'ber, Johann A. Makowsky, Tomer Kotek

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5344

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Coloring of graphs and hypergraphs (05C15)

Related Items

On sequences of polynomials arising from graph invariants, Polynomial graph invariants from homomorphism numbers, On weak chromatic polynomials of mixed graphs, On the complexity of generalized chromatic polynomials, A logician's view of graph polynomials, Connection Matrices for MSOL-Definable Structural Invariants