The following pages link to K. B. Reid (Q201981):
Displaying 50 items.
- (Q709317) (redirect page) (← links)
- Monochromatic sinks in nearly transitive arc-colored tournaments (Q709318) (← links)
- The relationship between two algorithms for decisions via sophisticated majority voting with an agenda (Q804450) (← links)
- Extending partial tournaments (Q969878) (← links)
- Largest polygons with vertices in a given finite set (Q1085439) (← links)
- Bipartite graphs obtained from adjacency matrices of orientations of graphs (Q1117951) (← links)
- Every vertex a king (Q1162521) (← links)
- Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure (Q1175774) (← links)
- Plurality preference digraphs realized by trees. II: On realization numbers (Q1197032) (← links)
- Peripheral and eccentric vertices in graphs (Q1205346) (← links)
- Mutually disjoint families of 0-1 sequences (Q1221762) (← links)
- Strongly self-complementary and hereditarily isomorphic tournaments (Q1229221) (← links)
- Edge sets contained in circuits (Q1229230) (← links)
- Cycles in the complement of a tree (Q1235715) (← links)
- Permutation groups generated by cycles of fixed length (Q1237836) (← links)
- Equitable agendas: Agendas ensuring identical sincere and sophisticated voting decisions (Q1360944) (← links)
- The \(k\)-ball \(l\)-path branch weight centroid (Q1382282) (← links)
- Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions (Q1910516) (← links)
- Sequences with adjacent elements unequal (Q2547554) (← links)
- Doubly regular tournaments are equivalent to skew Hadamard matrices (Q2552139) (← links)
- Bypasses in asymmetric digraphs (Q2562793) (← links)
- Equivalence of n-tournaments via k-path reversals (Q2562868) (← links)
- Balance in trees (Q2576832) (← links)
- Monotone reachability in arc-colored tournaments (Q2716675) (← links)
- Landau's theorem revisited again (Q2895339) (← links)
- Monochromatic sinks in arc-colored tournaments with small feedback arc sets (Q2908701) (← links)
- (Q3048856) (← links)
- (Q3070198) (← links)
- (Q3220616) (← links)
- (Q3346349) (← links)
- On arc-traceable tournaments (Q3419708) (← links)
- (Q3517171) (← links)
- (Q3688422) (← links)
- (Q3691764) (← links)
- Minimum path decompositions of oriented cubic graphs (Q3744186) (← links)
- (Q3821968) (← links)
- (Q3838217) (← links)
- (Q3872493) (← links)
- (Q3903026) (← links)
- (Q3950574) (← links)
- Centroids to centers in trees (Q3971220) (← links)
- The Number of Graphs on <i>N</i> VERTICES WITH 3 CLIQUES (Q4041602) (← links)
- (Q4047560) (← links)
- (Q4056043) (← links)
- (Q4065554) (← links)
- (Q4071265) (← links)
- (Q4118658) (← links)
- (Q4119209) (← links)
- (Q4128964) (← links)
- (Q4148014) (← links)
