Sharp lower bound for the total number of matchings of tricyclic graphs
From MaRDI portal
Publication:1960286
zbMath1264.05105MaRDI QIDQ1960286
Publication date: 13 October 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r132.html
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (4)
On the lower and upper bounds for different indices of tricyclic graphs ⋮ A classification for bicyclic and tricyclic graphs with respect to Tutte polynomial ⋮ On the number of independent sets in cycle-separated tricyclic graphs ⋮ Sharp bounds on the permanental sum of a graph
This page was built for publication: Sharp lower bound for the total number of matchings of tricyclic graphs
