"An upper bound for the depth-r interval number of the complete graph."

Markus Eckstein (1996)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2004-01-20

- no documents available
- export record
  dblp key:
  - journals/arscom/Eckstein96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/Eckstein96
Markus Eckstein:
An upper bound for the depth-r interval number of the complete graph. Ars Comb. 42 (1996)

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.