- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j11 |      | Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis: Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs. Graphs and Combinatorics 29(3): 359-364 (2013) |
| 2012 | ||
| j10 | | 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 | ||
| j9 | | 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) |
| j8 | | 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) |
| j7 | | 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) |
| c2 | | Arthur H. Busch, Feodor F. Dragan, R. Sritharan: New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs. COCOA (2) 2010: 207-218 |
| 2007 | ||
| j6 | | Arthur H. Busch, Michael Ferrara, Nathan Kahl: Generalizing D-graphs. Discrete Applied Mathematics 155(18): 2487-2495 (2007) |
| j5 | | David E. Brown, Arthur H. Busch, J. Richard Lundgren: Interval Tournaments. Journal of Graph Theory 56(1): 72-81 (2007) |
| c1 | | |
| 2006 | ||
| j4 | | Arthur H. Busch: A Note on the Number of Hamiltonian Paths in Strong Tournaments. Electr. J. Comb. 13(1) (2006) |
| j3 | | Arthur H. Busch: A characterization of triangle-free tolerance graphs. Discrete Applied Mathematics 154(3): 471-477 (2006) |
| j2 | | Arthur H. Busch, Michael S. Jacobson, K. Brooks Reid: On arc-traceable tournaments. Journal of Graph Theory 53(2): 157-166 (2006) |
| 2005 | ||
| j1 | | 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) |
Colors in the list of coauthors
Last update Mon May 20 17:16:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page