scientific article; zbMATH DE number 4160767

MaRDI QIDQ3487372zbMATH OpenFDO

Authors Dǎnuţ Marcu

Publication date 1989

zbMATH Keywords

connectivitydigraphvertex-disjoint paths(1,1)-factor

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• A note concerning paths and independence number in digraphs
• Degree and local connectivity in digraphs
• Paths, cycles, and arc‐connectivity in digraphs
• One-to-one disjoint path covers in digraphs

Cited in

(4)

• A note on \(k\)-connected rayless graphs
• Connectivity and extendability in digraphs
• A note concerning paths and independence number in digraphs
• One-to-one disjoint path covers in digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487372)