"Minimal identifying codes in trees and planar graphs with large girth."

David Auger (2010)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2009.11.012

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/Auger10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/Auger10
David Auger:
Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31(5): 1372-1384 (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.