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...
Príomhchruthaitheoirí: | Curticapean, R, Dell, H, Roth, M |
---|---|
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
Springer Nature
2018
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Counting edge-injective homomorphisms and matchings on restricted graph classes
de réir: Curticapean, R, et al.
Foilsithe / Cruthaithe: (2017) -
Parameterized counting of partially injective homomorphisms
de réir: Roth, M
Foilsithe / Cruthaithe: (2021) -
Counting, modular counting and graph homomorphisms
de réir: Magkakis, A
Foilsithe / Cruthaithe: (2016) -
Counting restricted homomorphisms via Möbius inversion over matroid lattices
de réir: Roth, M
Foilsithe / Cruthaithe: (2017) -
Counting homomorphisms to K4-minor-free graphs, modulo 2
de réir: Focke, J, et al.
Foilsithe / Cruthaithe: (2021)