Counting edge-injective homomorphisms and matchings on restricted graph classes

Curticapean, Radu and Dell, H and Roth, M (2017) Counting edge-injective homomorphisms and matchings on restricted graph classes. In: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics, LIPIcs (66). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 25:1-25:15. ISBN 978-3-95977-028-6 10.4230/LIPIcs.STACS.2017.25

[img] Text
Curticapean_25_3297078_ny.pdf

Download (645kB)
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 30 Nov 2017 19:45
Last Modified: 30 Nov 2017 19:45
URI: http://eprints.sztaki.hu/id/eprint/9220

Update Item Update Item