-free graphs of large minimum degree.
Hadwiger numbers of finite graphs
Hamiltonian circuits and path coverings of vertices in graphs
Hamiltonian circuits in cubic graphs
Hamiltonian Lines in Infinite Graphs with Few Verticles of Small Valency
Hamiltonian shortage, path partitions of vertices, and matchings in a graph
Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen.
Highly connected counterexamples to a conjecture on α-domination
An infinite class of counterexamples is given to a conjecture of Dahme et al. [1] concerning the minimum size of a dominating vertex set that contains at least a prescribed proportion of the neighbors of each vertex not belonging to the set.
Holes in graphs.
Homomorphisms of finite bipartite graphs onto complete bipartite graphs
Hyperbolic and Parabolic Packings.
Hyperbolicity and chordality of a graph.
Hypo-Eulerian and Hypo-Traversable Graphs.