Fan Chung Graham

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Noga Alon

> Home > Persons > Fan Chung Graham

Publications

2006
[j119]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dm/AlonC06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/AlonC06
Noga Alon, Fan R. K. Chung:
Explicit construction of linear sized tolerant networks. Discret. Math. 306(10-11): 1068-1071 (2006)
1994
[j69]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/AlonCG94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/AlonCG94
Noga Alon, Fan R. K. Chung, Ronald L. Graham:
Routing Permutations on Graphs Via Matchings. SIAM J. Discret. Math. 7(3): 513-530 (1994)
1993
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/AlonCG93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AlonCG93
Noga Alon, Fan R. K. Chung, Ronald L. Graham:
Routing permutations on graphs via matchings. STOC 1993: 583-591
1988
[j43]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/dm/AlonC88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/AlonC88
Noga Alon, Fan R. K. Chung:
Explicit construction of linear sized tolerant networks. Discret. Math. 72(1-3): 15-19 (1988)

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.