The tight upper bound for the number of matchings of tricyclic graphs
zbMATH Open1243.05194MaRDI QIDQ426849
Somayyeh Golalizadeh, Ardeshir Dolati
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p69
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
This page was built for publication: The tight upper bound for the number of matchings of tricyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426849)
