K. B. Reid - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2010

Monochromatic sinks in nearly transitive arc-colored tournamentsM. Melcher, K. B. Reid. DM, 310(20):2697-2704, 2010. [doi]

2006

On arc-traceable tournamentsArthur H. Busch, Michael S. Jacobson, K. B. Reid. jgt, 53(2):157-166, 2006. [doi]

Quadrangularity and strong quadrangularity in tournamentsJ. Richard Lundgren, K. B. Reid, Simone Severini, Dustin J. Stewart. ajc, 34:247-260, 2006. [doi]

2005

Balance in treesK. B. Reid, E. DePalma. DM, 304(1-3):34-44, 2005. [doi]

2002

KK. B. Reid. jgt, 41(2):85-100, 2002. [doi]

1999

Landau's Theorem revisitedJerrold R. Griggs, K. B. Reid. ajc, 20:19-24, 1999. [doi]

1995

Realization of digraphs by preferences based on distances in graphsWeizhen Gu, K. B. Reid, Walter Schnyder. jgt, 19(3):367-373, 1995. [doi]

Plurality preference digraphs realized by trees - I. Necessary and sufficient conditionsK. B. Reid, Weizhen Gu. DM, 147(1-3):185-196, 1995. [doi]

1994

Independent edges in bipartite graphs obtained from orientations of graphsJ. G. Gimbel, K. B. Reid. jgt, 18(5):515-533, 1994. [doi]

1992

Plurality preference digraphs realized by trees, II: on realization numbersK. B. Reid, Weizhen Gu. DM, 101(1-3):231-249, 1992. [doi]

Peripheral and eccentric vertices in graphsK. B. Reid, Weizhen Gu. gc, 8(4):361-375, 1992. [doi]

1991

The relationship between two algorithms for decisions via sophisticated majority voting with an agendaK. B. Reid. DAM, 31(1):23-28, 1991. [doi]

Centroids to centers in treesK. B. Reid. networks, 21(1):11-17, 1991. [doi]

1988

Bipartite graphs obtained from adjacency matrices of orientations of graphsK. B. Reid. DM, 72(1-3):321-330, 1988. [doi]

1987

Minimum path decompositions of oriented cubic graphsK. B. Reid, Keith Wayland. jgt, 11(1):113-118, 1987. [doi]

1986

Largest polygons with vertices in a given finite setCraig Cordes, K. B. Reid. DAM, 14(3):255-262, 1986. [doi]

1982

Every vertex a kingK. B. Reid. DM, 38(1):93-98, 1982. [doi]

1978

Degree frequencies in digraphs and tournamentsBrian Alspach, K. B. Reid. jgt, 2(3):241-249, 1978. [doi]

1976

Cycles in the complement of a treeK. B. Reid. DM, 15(2):163-174, 1976. [doi]

1975

Mutually disjoint families of 0-1 sequencesBrian Alspach, L. T. Ollmann, K. B. Reid. DM, 12(3):205-209, 1975. [doi]

1973

Equivalence of n-tournaments via k-path reversalsK. B. Reid. DM, 6(3):263-280, 1973. [doi]

1972

Doubly Regular Tournaments are Equivalent to Skew Hadamard MatricesK. B. Reid, Ezra Brown. JCT, 12(3):332-338, 1972.

Sign in or sign up to see more results.

runs on WebDSL