A construction of thickness-minimal graphs. A short proof of a linear arboricity theorem for cubic graphs. Generalized uniformly line vulnerable digraphs. On a modified concept of thickness of a graph. A note on removing a point of a strong digraph.
Digraphs maximal with respect to arc connectivity.
Enumeration of graphs maximal with respect to connectivity. Digraphs maximal with respect to connectivity. On Hamiltonian cycles of complete n -partite graphs. Note on a new coloring number of a graph.