Arthur H. Busch

According to our database1, Arthur H. Busch authored at least 16 papers between 2005 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Some completion problems for graphs without chordless cycles of prescribed lengths.
Discret. Appl. Math., 2019

2014
A Degree Sequence Variant of Graph Ramsey Numbers.
Graphs Comb., 2014

2013
Hamiltonian Spider Intersection Graphs Are Cycle Extendable.
SIAM J. Discret. Math., 2013

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs.
Graphs Comb., 2013

2012
Packing of graphic <i>n</i>-tuples.
J. Graph Theory, 2012

2010
Transitive partitions in realizations of tournament score sequences.
J. Graph Theory, 2010

A Min-Max Property of Chordal Bipartite Graphs with Applications.
Graphs Comb., 2010

Linear Time Recognition Algorithms and Structure Theorems for Bipartite Tolerance Graphs and Bipartite Probe Interval Graphs.
Discret. Math. Theor. Comput. Sci., 2010

New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

2007
Interval Tournaments.
J. Graph Theory, 2007

Generalizing D-graphs.
Discret. Appl. Math., 2007

Recognizing Bipartite Tolerance Graphs in Linear Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

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

A characterization of triangle-free tolerance graphs.
Discret. Appl. Math., 2006

A Note on the Number of Hamiltonian Paths in Strong Tournaments.
Electron. J. Comb., 2006

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


  Loading...