Counting Subgraphs via Homomorphisms
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- Vol. 26 (2) , 71-82
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- The complexity of homomorphism and constraint satisfaction problems seen from the other sideJournal of the ACM, 2007
- Proper minor-closed families are smallJournal of Combinatorial Theory, Series B, 2006
- The complexity of counting homomorphisms seen from the other sideTheoretical Computer Science, 2004
- Counting H-colorings of partial k-treesTheoretical Computer Science, 2002
- Color-codingJournal of the ACM, 1995
- Algorithms to count paths and cyclesInformation Processing Letters, 1994
- Genus g Graphs Have Pagenumber O(√g)Journal of Algorithms, 1994
- On the complexity of H-coloringJournal of Combinatorial Theory, Series B, 1990
- Dynamic programming meets the principle of inclusion and exclusionOperations Research Letters, 1982
- The complexity of computing the permanentTheoretical Computer Science, 1979