AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is not a semicomplete digraph must contain a k-connected spanning local tournament. This improves an earlier result of Guo and partially answers a question of Jackson and Thomassen
AbstractA digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractLet k be a positive integer. A strong digraph G is termed k-connected if the removal of any ...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
AbstractWe point out mistakes in two papers previously published in Discrete Applied Mathematics, de...
AbstractWe prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
AbstractWe consider two generalizations of tournaments, locally semicomplete digraphs introduced in ...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
International audienceA digraph is eulerian if it is connected and every vertex has its in-degree eq...
AbstractA digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractLet k be a positive integer. A strong digraph G is termed k-connected if the removal of any ...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
AbstractWe point out mistakes in two papers previously published in Discrete Applied Mathematics, de...
AbstractWe prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning...
AbstractRecently, Huang (1995) gave a characterization of local tournaments. His characterization in...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
Recently, Huang (1995) gave a characterization of local tournaments. His characterization involves a...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of ...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
AbstractWe consider two generalizations of tournaments, locally semicomplete digraphs introduced in ...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
International audienceA digraph is eulerian if it is connected and every vertex has its in-degree eq...
AbstractA digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors...
AbstractIn this paper we collect a substantial number of challenging open problems and conjectures o...
AbstractLet k be a positive integer. A strong digraph G is termed k-connected if the removal of any ...
DOI
Add to ORKG