This note is motivated by A.Kemnitz and B.Greger, Congr. Numer. 130 (1998)127-131. We show that the main result of the paper by Kemnitz and Greger is an easy consequence of the characterization of hamiltonian out-locally semicomplete digraphs by Bang-Jensen, Huang, and Prisner, J. Combin. Theory Ser. B 59 (1993) 267-287. We also disprove a conjecture from the paper of Kemnitz and Greger
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
This note is motivated by A.Kemnitz and B.Greger, Congr. Numer. 130 (1998)127-131. We show that the ...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraphs ...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
We show that for each β> 0, every digraph G of sufficiently large order n whose out-degree and in...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
We consider digraphs -- called extended locally semicomplete digraphs, or extended LSD's, for s...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
This note is motivated by A.Kemnitz and B.Greger, Congr. Numer. 130 (1998)127-131. We show that the ...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraphs ...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
AbstractA semicomplete multipartite digraph is obtained by replacing each edge of a complete multipa...
We show that for each β> 0, every digraph G of sufficiently large order n whose out-degree and in...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
We consider digraphs -- called extended locally semicomplete digraphs, or extended LSD's, for s...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...