On Counting Generalized Colorings

DOI10.1007/978-3-540-87531-4_25zbMATH Open1157.05024OpenAlexW1525035754MaRDI QIDQ3540189FDOQ3540189

Authors: Tomer Kotek, Johann A. Makowsky, Boris Zilber 

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

Recommendations

• On counting generalized colorings
• scientific article; zbMATH DE number 4116565
• scientific article; zbMATH DE number 3968609
• Generalized total colorings of graphs
• On generalized choice and coloring numbers
• On generalized graph colorings
• scientific article; zbMATH DE number 3912409
• Counting colorings on varieties
• On a generalized family of colorings
• scientific article; zbMATH DE number 4008419

Mathematics Subject Classification ID

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

Cited In (12)

• Harary polynomials
• How I got to like graph polynomials
• Title not available (Why is that?)
• On sequences of polynomials arising from graph invariants
• Title not available (Why is that?)
• Polynomial graph invariants from homomorphism numbers
• On weak chromatic polynomials of mixed graphs
• A logician's view of graph polynomials
• Twin-width and generalized coloring numbers
• On counting generalized colorings
• Connection Matrices for MSOL-Definable Structural Invariants
• On the complexity of generalized chromatic polynomials

This page was built for publication: On Counting Generalized Colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540189)