H-colouring Pt-free graphs in subexponential time

A graph is called P t -free if it does not contain the path on t vertices as an induced subgraph. Let H be a multigraph with the property that any two distinct vertices share at most one common neighbour. We show that the generating function for (list)graph homomorphisms from G to H can be calculate...

全面介绍

书目详细资料
Main Authors: Groenland, C, Okrasa, K, Rzążewski, P, Scott, A, Seymour, P, Spirkl, S
格式: Journal article
语言:English
出版: Elsevier 2019

相似书籍