Pages that link to "Item:Q1960286"
From MaRDI portal
The following pages link to Sharp lower bound for the total number of matchings of tricyclic graphs (Q1960286):
Displaying 9 items.
- On the lower and upper bounds for different indices of tricyclic graphs (Q295418) (← links)
- The tight upper bound for the number of matchings of tricyclic graphs (Q426849) (← links)
- On the number of independent sets in cycle-separated tricyclic graphs (Q552339) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- Sharp bounds on the permanental sum of a graph (Q2053704) (← links)
- The total number of matchings in triangle graph of a connected graph. (Q2804756) (← links)
- Sharp bounds for the number of matchings in generalized-theta-graphs (Q2866420) (← links)
- A classification for bicyclic and tricyclic graphs with respect to Tutte polynomial (Q5163725) (← links)
- Finding tricyclic graphs with a maximal number of matchings - another example of computer aided research in graph theory (Q5184945) (← links)