On -closed graphs
On ()-Decompositions of a Complete Graph
On Hadwiger number of a graph
On Hallian digraphs and their binding number
On Hallian digraphs, permanents and transversals
On Hamilton Circuits and Hamilton Paths.
On Hamiltonian circuits and spanning trees of hypercubes
On Hamiltonian consecutive-d digraphs
On Hamiltonian cycles in two-triangle graphs
On Hamiltonian cycles of complete -partite graphs
On Hamiltonian properties of powers of special Hamiltonian graphs
On Harpers’ result concerning the bandwidths of graphs
In this paper, we improve the result by Harper on the lower bound of the bandwidth of connected graphs. In addition, we prove that considerating the interior boundary and the exterior boundary when estimating the bandwidth of connected graphs gives the same results.
On hereditary properties of composition graphs
The composition graph of a family of n+1 disjoint graphs is the graph H obtained by substituting the n vertices of H₀ respectively by the graphs H₁,H₂,...,Hₙ. If H has some hereditary property P, then necessarily all its factors enjoy the same property. For some sort of graphs it is sufficient that all factors have a certain common P to endow H with this P. For instance, it is known that the composition graph of a family of perfect graphs is also a perfect graph (B. Bollobas, 1978), and the...
On hereditary subdirectly irreducible graphs
On highly closed cellular algebras and highly closed isomorphisms.
On homomorphism perfect graphs
On homotopical equivalence of tolerance spaces
On hypergraph coverings
On hypergraphs of maximal simple paths of a class of Hamiltonian graphs
On hypergraphs with every four points spanning at most two triples.