Counting Subgraphs via Homomorphisms
Publication:5902149
DOI10.1007/978-3-642-02927-1_8zbMath1247.05107OpenAlexW1604283551WikidataQ60488681 ScholiaQ60488681MaRDI QIDQ5902149
Omid Amini, Saket Saurabh, Fedor V. Fomin
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_8
exact algorithmscounting subgraphsparametrized algorithmscounting perfect matchingscolor coding based algorithmscomputing chromatic polynomialcounting graph homomorphismscounting Hamiltonian cycles
Combinatorics in computer science (68R05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
This page was built for publication: Counting Subgraphs via Homomorphisms