"The least number of edges for graphs having dihedral automorphism group."

Gary Haggard (1973)

> Home

Details and statistics

DOI: 10.1016/0012-365X(73)90036-8

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/Haggard73
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Haggard73
Gary Haggard:
The least number of edges for graphs having dihedral automorphism group. Discret. Math. 6(1): 53-78 (1973)

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.