pdf-format: |
|
@Article{ellismonaghan_et_al:DR:2016:6726, author = {Jo Ellis-Monaghan and Andrew Goodall and Johann A. Makowsky and Iain Moffatt}, title = {{Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)}}, pages = {26--48}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {6}, editor = {Jo Ellis-Monaghan and Andrew Goodall and Johann A. Makowsky and Iain Moffatt}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6726}, URN = {urn:nbn:de:0030-drops-67266}, doi = {10.4230/DagRep.6.6.26}, annote = {Keywords: complexity, counting functions, graph colourings, graph homomorphisms, graph invariants, graph polynomials, matroid invariants, second order logic, } }
Keywords: | complexity, counting functions, graph colourings, graph homomorphisms, graph invariants, graph polynomials, matroid invariants, second order logic, | |
Freie Schlagwörter (englisch): | topological graph theory | |
Seminar: | Dagstuhl Reports, Volume 6, Issue 6 | |
Issue date: | 2016 | |
Date of publication: | 17.11.2016 |