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
|
相似书籍
-
Subexponential Parameterized Algorithms on Graphs of Bounded Genus and H-minor-free Graphs
由: Demaine, Erik D., et al.
出版: (2023) -
Pseudodeterministic constructions in subexponential time
由: Oliveira, I, et al.
出版: (2017) -
Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Moments
由: Chen, Sitan, et al.
出版: (2022) -
Clique covers of H-free graphs
由: Nguyen, T, et al.
出版: (2023) -
Maximising H-colourings of graphs
由: Guggiari, H, et al.
出版: (2019)