Counting edge-injective homomorphisms and matchings on restricted graph classes
We consider the #W[1]-hard problem of counting all matchings with exactly k edges in a given input graph G; we prove that it remains #W[1]-hard on graphs G that are line graphs or bipartite graphs with degree 2 on one side. In our proofs, we use that k-matchings in line graphs can be equivalently vi...
Prif Awduron: | Curticapean, R, Dell, H, Roth, M |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Springer Nature
2018
|
Eitemau Tebyg
-
Counting edge-injective homomorphisms and matchings on restricted graph classes
gan: Curticapean, R, et al.
Cyhoeddwyd: (2017) -
Parameterized counting of partially injective homomorphisms
gan: Roth, M
Cyhoeddwyd: (2021) -
Counting, modular counting and graph homomorphisms
gan: Magkakis, A
Cyhoeddwyd: (2016) -
Counting restricted homomorphisms via Möbius inversion over matroid lattices
gan: Roth, M
Cyhoeddwyd: (2017) -
Counting homomorphisms to K4-minor-free graphs, modulo 2
gan: Focke, J, et al.
Cyhoeddwyd: (2021)