Andreas Holtkamp

According to our database1, Andreas Holtkamp authored at least 9 papers between 2009 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Restricted arc-connectivity in tournaments.
Discret. Appl. Math., 2013

Restricted arc-connectivity of bipartite tournaments.
Discret. Appl. Math., 2013

Connectivity of local tournaments.
Australas. J Comb., 2013

2012
k-restricted edge-connectivity in triangle-free graphs.
Discret. Appl. Math., 2012

2011
On local connectivity of K<sub>2, p</sub>-free graphs.
Australas. J Comb., 2011

Maximal local edge-connectivity of diamond-free graphs.
Australas. J Comb., 2011

On set colorings of complete bipartite graphs.
Australas. J Comb., 2011

2010
On local connectivity of graphs with given clique number.
J. Graph Theory, 2010

2009
On the connectivity of p-diamond-free graphs.
Discret. Math., 2009


  Loading...