K. Brooks Reid

According to our database1, K. Brooks Reid authored at least 32 papers between 1972 and 2010.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2010
Monochromatic sinks in nearly transitive arc-colored tournaments.
Discret. Math., 2010

2009
Extending partial tournaments.
Math. Comput. Model., 2009

2008
Axiomization of the center function on trees.
Australas. J Comb., 2008

2007
The Domination Graphs of Complete Paired Comparison Digraphs.
Ars Comb., 2007

2006
On arc-traceable tournaments.
J. Graph Theory, 2006

Quadrangularity and strong quadrangularity in tournaments.
Australas. J Comb., 2006

2005
On a conjecture of Quintas and arc-traceability in upset tournaments.
Discuss. Math. Graph Theory, 2005

Balance in trees.
Discret. Math., 2005

2004
Domination and irredundance in tournaments.
Australas. J Comb., 2004

2003
Domination Graphs of Tournaments with Isolated Vertices.
Ars Comb., 2003

2002
Total relative displacement of vertex permutations of <i>K</i>.
J. Graph Theory, 2002

2001
Domination Graphs with Nontrivial Components.
Graphs Comb., 2001

1999
Balance vertices in trees.
Networks, 1999

Landau's Theorem revisited.
Australas. J Comb., 1999

1998
The domination and competition graphs of a tournament.
J. Graph Theory, 1998

1997
The k-ball l-path Branch Weight Centroid.
Discret. Appl. Math., 1997

1995
Realization of digraphs by preferences based on distances in graphs.
J. Graph Theory, 1995

Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions.
Discret. Math., 1995

1994
Independent edges in bipartite graphs obtained from orientations of graphs.
J. Graph Theory, 1994

1992
Peripheral and eccentric vertices in graphs.
Graphs Comb., 1992

Plurality preference digraphs realized by trees, II: on realization numbers.
Discret. Math., 1992

1991
Centroids to centers in trees.
Networks, 1991

The relationship between two algorithms for decisions via sophisticated majority voting with an agenda.
Discret. Appl. Math., 1991

1988
Bipartite graphs obtained from adjacency matrices of orientations of graphs.
Discret. Math., 1988

1987
Minimum path decompositions of oriented cubic graphs.
J. Graph Theory, 1987

1986
Largest polygons with vertices in a given finite set.
Discret. Appl. Math., 1986

1982
Every vertex a king.
Discret. Math., 1982

1978
Degree frequencies in digraphs and tournaments.
J. Graph Theory, 1978

1976
Cycles in the complement of a tree.
Discret. Math., 1976

1975
Mutually disjoint families of 0-1 sequences.
Discret. Math., 1975

1973
Equivalence of n-tournaments via k-path reversals.
Discret. Math., 1973

1972
Doubly Regular Tournaments are Equivalent to Skew Hadamard Matrices.
J. Comb. Theory A, 1972


  Loading...