We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed ...
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska