K. Brooks Reid

From MaRDI portal
Person:201981

Available identifiers

zbMath Open reid.k-brooksWikidataQ6323127 ScholiaQ6323127MaRDI QIDQ201981

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q51336422020-11-10Paper
https://portal.mardi4nfdi.de/entity/Q29087012012-09-05Paper
Landau's Theorem Revisited Again2012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q30701982011-02-02Paper
Monochromatic sinks in nearly transitive arc-colored tournaments2010-10-18Paper
Extending partial tournaments2010-05-08Paper
https://portal.mardi4nfdi.de/entity/Q35171712008-08-12Paper
On arc-traceable tournaments2007-02-07Paper
On a conjecture of Quintas and arc-traceability in upset tournaments2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54879192006-09-13Paper
Balance in trees2005-12-29Paper
https://portal.mardi4nfdi.de/entity/Q54660662005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q48187952004-10-01Paper
Quadrangularity and Strong Quadrangularity in Tournaments2004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q44582162004-03-17Paper
Total relative displacement of vertex permutations of K2003-03-19Paper
Domination graphs with nontrivial components2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q27166752002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q49435242000-03-16Paper
Balance vertices in trees2000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42694281999-12-02Paper
The domination and competition graphs of a tournament1999-08-23Paper
https://portal.mardi4nfdi.de/entity/Q43933641999-06-10Paper
The \(k\)-ball \(l\)-path branch weight centroid1998-11-01Paper
https://portal.mardi4nfdi.de/entity/Q38382171998-08-09Paper
https://portal.mardi4nfdi.de/entity/Q43906061998-05-26Paper
Equitable agendas: Agendas ensuring identical sincere and sophisticated voting decisions1997-07-23Paper
https://portal.mardi4nfdi.de/entity/Q52840851997-05-19Paper
Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions1996-03-24Paper
Realization of digraphs by preferences based on distances in graphs1995-09-28Paper
https://portal.mardi4nfdi.de/entity/Q42946241994-05-17Paper
Peripheral and eccentric vertices in graphs1993-04-01Paper
Plurality preference digraphs realized by trees. II: On realization numbers1993-01-16Paper
Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure1992-06-25Paper
Centroids to centers in trees1992-06-25Paper
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda1991-01-01Paper
Bipartite graphs obtained from adjacency matrices of orientations of graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38219681988-01-01Paper
Minimum path decompositions of oriented cubic graphs1987-01-01Paper
Largest polygons with vertices in a given finite set1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917641985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206161984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33463491984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884221983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505741983-01-01Paper
Every vertex a king1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39030261980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30488561978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38724931978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41525641978-01-01Paper
Degree frequencies in digraphs and tournaments1978-01-01Paper
Permutation groups generated by cycles of fixed length1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41186581977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41480141977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41548981977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41934681977-01-01Paper
Strongly self-complementary and hereditarily isomorphic tournaments1976-01-01Paper
Edge sets contained in circuits1976-01-01Paper
Cycles in the complement of a tree1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41192091976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41289641976-01-01Paper
Mutually disjoint families of 0-1 sequences1975-01-01Paper
Bypasses in asymmetric digraphs1974-01-01Paper
The Number of Graphs on N VERTICES WITH 3 CLIQUES1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655541974-01-01Paper
Equivalence of n-tournaments via k-path reversals1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40712651973-01-01Paper
Doubly regular tournaments are equivalent to skew Hadamard matrices1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41689451972-01-01Paper
Sequences with adjacent elements unequal1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40475601971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40560431971-01-01Paper
Connectivity in Products of Graphs1970-01-01Paper
Disproof of a conjecture of Erdös and moser on tournaments1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56440001970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595751970-01-01Paper
On Sets of Arcs Containing No Cycles in a Tournament*1969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: K. Brooks Reid