Richard A. Brualdi

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 Jian Shen

> Home > Persons > Richard A. Brualdi

Publications

2002
[j57]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/BrualdiS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/BrualdiS02
Richard A. Brualdi, Jian Shen:
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs. J. Comb. Theory B 85(2): 189-196 (2002)
2001
[j56]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/BrualdiS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BrualdiS01
Richard A. Brualdi, Jian Shen:
Diameter of the NEPS of bipartite graphs. Discret. Math. 226(1-3): 373-376 (2001)
[j54]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/BrualdiS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/BrualdiS01
Richard A. Brualdi, Jian Shen:
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments. J. Graph Theory 38(4): 244-254 (2001)
1999
[j53]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorics/BrualdiS99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorics/BrualdiS99
Richard A. Brualdi, Jian Shen:
Discrepancy of Matrices of Zeros and Ones. Electron. J. Comb. 6 (1999)

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.