 | 2012 |
| 12 |  | Arthur H. Busch,
Michael J. Ferrara,
Stephen G. Hartke,
Michael S. Jacobson,
Hemanshu Kaul,
Douglas B. West:
Packing of graphic n-tuples.
Journal of Graph Theory 70(1): 29-39 (2012) |
| 2010 |
| 11 |  | Arthur H. Busch,
Feodor F. Dragan,
R. Sritharan:
New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.
COCOA (2) 2010: 207-218 |
| 10 |  | David E. Brown,
Arthur H. Busch,
Garth Isaak:
Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs.
Discrete Mathematics & Theoretical Computer Science 12(5): 63-82 (2010) |
| 9 |  | Atif A. Abueida,
Arthur H. Busch,
R. Sritharan:
A Min-Max Property of Chordal Bipartite Graphs with Applications.
Graphs and Combinatorics 26(3): 301-313 (2010) |
| 8 |  | Arthur H. Busch,
Guantao Chen,
Michael S. Jacobson:
Transitive partitions in realizations of tournament score sequences.
Journal of Graph Theory 64(1): 52-62 (2010) |
| 2007 |
| 7 |  | Arthur H. Busch,
Garth Isaak:
Recognizing Bipartite Tolerance Graphs in Linear Time.
WG 2007: 12-20 |
| 6 |  | Arthur H. Busch,
Michael Ferrara,
Nathan Kahl:
Generalizing D-graphs.
Discrete Applied Mathematics 155(18): 2487-2495 (2007) |
| 5 |  | David E. Brown,
Arthur H. Busch,
J. Richard Lundgren:
Interval Tournaments.
Journal of Graph Theory 56(1): 72-81 (2007) |
| 2006 |
| 4 |  | Arthur H. Busch:
A characterization of triangle-free tolerance graphs.
Discrete Applied Mathematics 154(3): 471-477 (2006) |
| 3 |  | Arthur H. Busch:
A Note on the Number of Hamiltonian Paths in Strong Tournaments.
Electr. J. Comb. 13(1): (2006) |
| 2 |  | Arthur H. Busch,
Michael S. Jacobson,
K. Brooks Reid:
On arc-traceable tournaments.
Journal of Graph Theory 53(2): 157-166 (2006) |
| 2005 |
| 1 |  | Arthur H. Busch,
Michael S. Jacobson,
K. Brooks Reid:
On a conjecture of Quintas and arc-traceability in upset tournaments.
Discussiones Mathematicae Graph Theory 25(3): 345-354 (2005) |