A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4200250
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs |
scientific article; zbMATH DE number 4200250 |
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
0.92853546
0 references
0.8673315
0 references
0.86323094
0 references
0.86271626
0 references
0.8626864
0 references
