"Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning ..."

Mordecai J. Golin, Yiu-Cho Leung (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-30559-0_25

access: closed

type: Conference or Workshop Paper

metadata version: 2017-06-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/GolinL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/GolinL04
Mordecai J. Golin, Yiu-Cho Leung:
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. WG 2004: 296-307

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.