"An efficient approach for counting the number of spanning trees in ..."

Talip Atajan, Xuerong Yong, Hiroshi Inaba (2010)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2009.11.033

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/AtajanYI10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/AtajanYI10
Talip Atajan, Xuerong Yong, Hiroshi Inaba:
An efficient approach for counting the number of spanning trees in circulant and related graphs. Discret. Math. 310(6-7): 1210-1221 (2010)

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.