Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach

DOI10.1016/j.disc.2007.07.113zbMath1161.05039OpenAlexW2095204146MaRDI QIDQ941336

Stéphane Bessy

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.113

zbMATH Keywords

digraphsvertex-connectivityvertex-partitionChvátal-Erdős conditions

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Ramsey-type results for path covers and path partitions. II: Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A short proof of the Chen-Manalastas theorem
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• A note on Hamiltonian circuits

This page was built for publication: Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach