Pages that link to "Item:Q5184945"

The following pages link to Finding tricyclic graphs with a maximal number of matchings - another example of computer aided research in graph theory (Q5184945):

Displaying 12 items.

• The maximum matching energy of bicyclic graphs with even girth (Q277654) (← links)
• The minimum matching energy of bicyclic graphs with given girth (Q329923) (← links)
• The bipartite unicyclic graphs with the first \(\lfloor \frac{n - 3}{4} \rfloor\) largest matching energies (Q668164) (← links)
• Extremal values of matching energies of one class of graphs (Q668568) (← links)
• The matching energy of a graph (Q713314) (← links)
• On the ordering of graphs with respect to their matching numbers (Q1103635) (← links)
• On ordering of complements of graphs with respect to matching numbers (Q1731077) (← links)
• Matchings in graphs with a given number of cuts (Q2192102) (← links)
• Extremal polyomino chains on \(k\)-matchings and \(k\)-independent sets (Q2385379) (← links)
• On the k-matchings of the complements of bicyclic graphs (Q4634518) (← links)
• Matchings in starlike trees (Q5950594) (← links)
• Matchings in bipartite graphs with a given number of cuts (Q6633545) (← links)