On the unitary Cayley graph of a finite ring.
On upper embeddability of complementary graphs
On Vertices Enforcing a Hamiltonian Cycle
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined.
Orientable self-embeddings of Steiner triple systems of order 15.
Orientably simple graphs
Oriented relative embeddings of graphs
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions.