DOIAbstract
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph on n and n vertices is n + 1, thereby establishing a conjecture of Chein
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph on n and n vertices is n + 1, thereby establishing a conjecture of Chein
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* an...
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
AbstractA proof is presented of the conjecture of Alspach and Pullman that for any digraph G on n ≥ ...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractA path decomposition of a digraph D is a partition of its edge set into edge disjoint simple...
11 pages, 2 figures, to appear in Discrete MathematicsInternational audienceLet $P_n$ denote the und...
AbstractWe give several sufficient conditions on the half-degrees of a bipartite digraph for the exi...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
AbstractFor a fixed pair of integers r, s ≥ 2, all positive integers m and n are determined which ha...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* an...
AbstractIn this paper it is proved that the path number of the complete symmetric bipartite digraph ...
AbstractA proof is presented of the conjecture of Alspach and Pullman that for any digraph G on n ≥ ...
AbstractSay a digraph is k-free if it has no directed cycles of length at most k, for k∈Z+. Thomassé...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
The Directed Path Partition Conjecture is the following: If D is a digraph that contains no path wit...
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mu...
AbstractA path decomposition of a digraph D is a partition of its edge set into edge disjoint simple...
11 pages, 2 figures, to appear in Discrete MathematicsInternational audienceLet $P_n$ denote the und...
AbstractWe give several sufficient conditions on the half-degrees of a bipartite digraph for the exi...
AbstractLet Pn denote the undirected path of length n−1. The cardinality of the set of congruence cl...
AbstractFor a fixed pair of integers r, s ≥ 2, all positive integers m and n are determined which ha...
AbstractA digraph D verifies the Chvátal–Erdős conditions if α(D)⩽κ(D), where α(D) is the stability ...
AbstractIn this article, we give conditions on the total degrees of the vertices in a strong digraph...
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when...
In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* an...
Add to ORKG