A Chvátal-Erdős condition for (1,1)-factors in digraphs

DOI10.1016/0012-365X(85)90169-4zbMath0586.05020MaRDI QIDQ1071779

Bill Jackson, Oscar Ordaz

Publication date: 1985

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

zbMATH Keywords

independence numbercircuitfactorvertex disjoint pathshamiltonian digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

A sufficient condition for oriented graphs to be Hamiltonian ⋮ A Chvátal-Erdős condition for Hamilton cycles in digraphs ⋮ On \(k\)-strong and \(k\)-cyclic digraphs ⋮ Variations on the Gallai-Milgram theorem ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs

Cites Work

• Circuits through specified edges
• A note on Hamiltonian circuits
• Long Cycles in Digraphs
• Unnamed Item
• Unnamed Item

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