DOIAbstract
AbstractIn this paper we show that a 2-connected locally semicomplete digraph of order at least 8 is not cycle complementary if and only if it is 2-diregular and has odd order. This result yields immediately two conjectures of Bang-Jensen
AbstractIn this paper we show that a 2-connected locally semicomplete digraph of order at least 8 is not cycle complementary if and only if it is 2-diregular and has odd order. This result yields immediately two conjectures of Bang-Jensen
AbstractWe prove that if T is a tournament on n⩾7 vertices and x,y are distinct vertices of T with t...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractThe vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation o...
AbstractAn in-tournament is an oriented graph such that the negative neighborhood of every vertex in...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractIt is well known that the problem of deciding whether a given digraph has a k-cycle factor f...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
A tournament is a directed graph obtained by assigning a direction for each edge in an undirected co...
AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractWe prove that if T is a tournament on n⩾7 vertices and x,y are distinct vertices of T with t...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractThe vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation o...
AbstractAn in-tournament is an oriented graph such that the negative neighborhood of every vertex in...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractIt is well known that the problem of deciding whether a given digraph has a k-cycle factor f...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
A tournament is a directed graph obtained by assigning a direction for each edge in an undirected co...
AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractWe prove that if T is a tournament on n⩾7 vertices and x,y are distinct vertices of T with t...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractThe vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation o...
Add to ORKG