A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164)

From MaRDI portal
Revision as of 15:58, 21 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers