"The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs."

Ardeshir Dolati, Somayyeh Golalizadeh (2012)

> Home

Details and statistics

DOI: 10.37236/2165

access: closed

type: Journal Article

metadata version: 2022-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorics/DolatiG12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/DolatiG12
Ardeshir Dolati, Somayyeh Golalizadeh:
The Tight Upper Bound for the Number of Matchings of Tricyclic Graphs. Electron. J. Comb. 19(1): 69 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.