AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization of both semicomplete and semicomplete bipartite digraphs in 1993. Later, Bang-Jensen (2004), Galeana-Sánchez and Goldfeder (2009) and Wang and Wang (2009) provided a characterization of strong arc-locally semicomplete digraphs. In this paper, we provide a characterization of strong and non-strong arc-locally semicomplete digraphs which generalizes some results by Bang-Jensen
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
In this paper, we generalized the above known results and show that this conjecture holds for every ...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractWe point out mistakes in two papers previously published in Discrete Applied Mathematics, de...
AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractA digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors...
AbstractIn this paper we show that a 2-connected locally semicomplete digraph of order at least 8 is...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
In this paper, we generalized the above known results and show that this conjecture holds for every ...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractWe point out mistakes in two papers previously published in Discrete Applied Mathematics, de...
AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractA digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors...
AbstractIn this paper we show that a 2-connected locally semicomplete digraph of order at least 8 is...
A digraph D is called semicomplete if for each pair of distinct vertices u, v {dollar}\\in{dollar} V...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractLet D be an arc-3-cyclic, semicomplete digraph and uv be an arc of D contained in a cycle of...
In this paper, we generalized the above known results and show that this conjecture holds for every ...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...