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 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on Hamiltonian circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Network-Flow Feasibility Theorem and Combinatorial Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circuits through specified edges / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Chvátal-Erdős condition for (1,1)-factors in digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3291034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Long Cycles in Digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:58, 21 June 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
