sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000015702380 | 1 hits
Person
ISNI: 
0000 0000 1570 2380
Name: 
Osthus, D.
Osthus, Deryk
Osthus, Deryk Simeon,
Dates: 
1974-
Creation class: 
text
txt
Creation role: 
author
Related names: 
Berlin, Humboldt-University
University of Birmingham
Titles: 
Critical chromatic number and the complexity of perfect packings in graphs
Dirac-Type Result on Hamilton Cycles in Oriented Graphs, A
For which densities are random triangle-free graphs almost surely bipartite?
Induced subdivisions in K_{s,s}-free graphs of large average degree
Large Topological Cliques in Graphs Without a 4-Cycle
Linkedness and Ordered Cycles in Digraphs
Loose Hamilton cycles in 3-uniform hypergraphs of large minimum degree
Maximizing Several Cuts Simultaneously
Minors in graphs of large girth
On the evolution of random discrete structures
order of the largest complete minor in a random graph, The
Packings in Dense Regular Graphs
Notes: 
Berlin, Humboldt-University, Diss., 2000
Sources: 
JNAM