A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs |
scientific article |
Statements
A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (English)
0 references
1988
0 references
The authors give, first, a sufficient condition for the existence of a (t,t)-factor with specified arcs, in a digraph, and then, a sufficient condition, involving the number of arcs and connectivity, for an oriented graph to contain a (t,t)-factor.
0 references
(t,t)-factor
0 references
oriented graph
0 references
