default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Brooks Reid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j32]M. Melcher, K. B. Reid:
Monochromatic sinks in nearly transitive arc-colored tournaments. Discret. Math. 310(20): 2697-2704 (2010)- 2009
- [j31]LeRoy B. Beasley, David E. Brown, K. Brooks Reid:
Extending partial tournaments. Math. Comput. Model. 50(1-2): 287-291 (2009) - 2008
- [j30]Henry Martyn Mulder, Michael J. Pelsmajer, K. Brooks Reid:
Axiomization of the center function on trees. Australas. J Comb. 41: 223-226 (2008) - 2007
- [j29]J. Richard Lundgren, K. Brooks Reid, Dustin J. Stewart:
The Domination Graphs of Complete Paired Comparison Digraphs. Ars Comb. 85 (2007) - 2006
- [j28]J. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart:
Quadrangularity and strong quadrangularity in tournaments. Australas. J Comb. 34: 247-260 (2006) - [j27]Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid:
On arc-traceable tournaments. J. Graph Theory 53(2): 157-166 (2006) - 2005
- [j26]K. B. Reid, E. DePalma:
Balance in trees. Discret. Math. 304(1-3): 34-44 (2005) - [j25]Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid:
On a conjecture of Quintas and arc-traceability in upset tournaments. Discuss. Math. Graph Theory 25(3): 345-354 (2005) - 2004
- [j24]K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and irredundance in tournaments. Australas. J Comb. 29: 157-172 (2004) - 2003
- [j23]David C. Fisher, J. Richard Lundgren, David R. Guichard, Sarah K. Merz, K. Brooks Reid:
Domination Graphs of Tournaments with Isolated Vertices. Ars Comb. 66 (2003) - 2002
- [j22]K. B. Reid:
Total relative displacement of vertex permutations of K. J. Graph Theory 41(2): 85-100 (2002) - 2001
- [j21]David C. Fisher, David R. Guichard, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid:
Domination Graphs with Nontrivial Components. Graphs Comb. 17(2): 227-236 (2001) - 1999
- [j20]Jerrold R. Griggs, K. B. Reid:
Landau's Theorem revisited. Australas. J Comb. 20: 19-24 (1999) - [j19]K. Brooks Reid:
Balance vertices in trees. Networks 34(4): 264-271 (1999) - 1998
- [j18]David C. Fisher, J. Richard Lundgren, Sarah K. Merz, K. Brooks Reid:
The domination and competition graphs of a tournament. J. Graph Theory 29(2): 103-110 (1998) - 1997
- [j17]K. Brooks Reid:
The k-ball l-path Branch Weight Centroid. Discret. Appl. Math. 80(2-3): 239-246 (1997) - 1995
- [j16]K. B. Reid, Weizhen Gu:
Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions. Discret. Math. 147(1-3): 185-196 (1995) - [j15]Weizhen Gu, K. B. Reid, Walter Schnyder:
Realization of digraphs by preferences based on distances in graphs. J. Graph Theory 19(3): 367-373 (1995) - 1994
- [j14]John G. Gimbel, K. B. Reid:
Independent edges in bipartite graphs obtained from orientations of graphs. J. Graph Theory 18(5): 515-533 (1994) - 1992
- [j13]K. B. Reid, Weizhen Gu:
Plurality preference digraphs realized by trees, II: on realization numbers. Discret. Math. 101(1-3): 231-249 (1992) - [j12]K. B. Reid, Weizhen Gu:
Peripheral and eccentric vertices in graphs. Graphs Comb. 8(4): 361-375 (1992) - 1991
- [j11]K. B. Reid:
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda. Discret. Appl. Math. 31(1): 23-28 (1991) - [j10]K. B. Reid:
Centroids to centers in trees. Networks 21(1): 11-17 (1991) - 1988
- [j9]K. B. Reid:
Bipartite graphs obtained from adjacency matrices of orientations of graphs. Discret. Math. 72(1-3): 321-330 (1988) - 1987
- [j8]K. B. Reid, Keith Wayland:
Minimum path decompositions of oriented cubic graphs. J. Graph Theory 11(1): 113-118 (1987) - 1986
- [j7]Craig Cordes, K. B. Reid:
Largest polygons with vertices in a given finite set. Discret. Appl. Math. 14(3): 255-262 (1986) - 1982
- [j6]K. B. Reid:
Every vertex a king. Discret. Math. 38(1): 93-98 (1982) - 1978
- [j5]Brian Alspach, K. B. Reid:
Degree frequencies in digraphs and tournaments. J. Graph Theory 2(3): 241-249 (1978) - 1976
- [j4]K. B. Reid:
Cycles in the complement of a tree. Discret. Math. 15(2): 163-174 (1976) - 1975
- [j3]Brian Alspach, L. T. Ollmann, K. B. Reid:
Mutually disjoint families of 0-1 sequences. Discret. Math. 12(3): 205-209 (1975) - 1973
- [j2]K. B. Reid:
Equivalence of n-tournaments via k-path reversals. Discret. Math. 6(3): 263-280 (1973) - 1972
- [j1]K. B. Reid, Ezra Brown:
Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices. J. Comb. Theory A 12(3): 332-338 (1972)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
