Supereulerian Locally Semicomplete Multipartite Digraphs
- Feng Liu
- Zeng-Xian Tian
- Deming Li
DOIAbstract
In this paper, we generalized the above known results and show that this conjecture holds for every strong locally semicomplete multipartite digraph
In this paper, we generalized the above known results and show that this conjecture holds for every strong locally semicomplete multipartite digraph
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractA digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pa...
AbstractWe prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning...
In this paper, we generalized the above known results and show that this conjecture holds for every ...
A digraph D is eulerian if D is connected and for any v ∈ V ( D), d+D( v) = d-D( v). A digraph D is ...
International audienceA digraph is eulerian if it is connected and every vertex has its in-degree eq...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractWe point out mistakes in two papers previously published in Discrete Applied Mathematics, de...
1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dic...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is...
AbstractThomassen (1991) proved that there is no degree of strong connectivity which guarantees a cy...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractA digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pa...
AbstractWe prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning...
In this paper, we generalized the above known results and show that this conjecture holds for every ...
A digraph D is eulerian if D is connected and for any v ∈ V ( D), d+D( v) = d-D( v). A digraph D is ...
International audienceA digraph is eulerian if it is connected and every vertex has its in-degree eq...
AbstractWe investigate the existence of a spanning local tournament with possibly high connectivity ...
AbstractA digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x,y, every in-...
AbstractWe point out mistakes in two papers previously published in Discrete Applied Mathematics, de...
1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dic...
AbstractArc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of ...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractWe prove a result which implies that every k-connected locally semicomplete digraph which is...
AbstractThomassen (1991) proved that there is no degree of strong connectivity which guarantees a cy...
AbstractArc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization ...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractA digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pa...
AbstractWe prove that every 3-strong semicomplete digraph on at least 5 vertices contains a spanning...
Add to ORKG