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

DOI10.1016/0012-365X(88)90067-2zbMath0727.05046MaRDI QIDQ803164

Oscar Ordaz, Pierre Fraisse

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

oriented graph(t,t)-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• Circuits through specified edges
• A note on Hamiltonian circuits
• A Network-Flow Feasibility Theorem and Combinatorial Applications
• Long Cycles in Digraphs
• On the theory of graphs

This page was built for publication: A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs