On alternating products of graph relations.
On amalgamation of graphs and essential sets of generators
On Arbitrarily Traceable Graphs.
On centrally symmetric graphs
In this note we extend results on the covering graphs of modular lattices (Zelinka) and semimodular lattices (Gedeonova, Duffus and Rival) to the covering graph of certain graded lattices.
On Certain Homomorphism Properties of Graphs I.
On chromatic and achromatic numbers of uniform hypergraphs
On classes of graphs determined by forbidden subgraphs
On coefficients of path polynomials.
On connected graphs containing exactly two points of the same degree
On coverings of random graphs
On cyclically embeddable (n,n)-graphs
An embedding of a simple graph G into its complement G̅ is a permutation σ on V(G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n,n)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
On Decompositions of Complete Graphs into Factors with Given Radii
On decompositions of complete graphs into factors with given diameters and radii
On decompositions of complete -uniform hypergraphs
On distances between isomorphism classes of graphs
In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorphism classes of) two graphs based on 'edge rotations'. Here, that measure and two related measures are explored. Various bounds, exact values for classes of graphs and relationships are proved, and the three measures are shown to be intimately linked to 'slowly-changing' parameters.
On domatic numbers of graphs
On generalized outerplanarity of line graphs
On generating of relations
On graphs associated to rings.
On graphs containing many subgraphs with the same number of edges