The Path Partition Conjecture is true for some generalizations of tournaments

DOI10.1016/J.DISC.2012.10.014zbMATH Open1256.05085OpenAlexW1975303747WikidataQ123365562 ScholiaQ123365562MaRDI QIDQ1928451FDOQ1928451

Authors: Alan Arroyo, Hortensia Galeana-Sánchez 

Publication date: 3 January 2013

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

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

Recommendations

• Longest path partitions in generalizations of tournaments
• On the Berge's strong path partition conjecture
• The directed path partition conjecture
• Extended path partition conjecture for semicomplete and acyclic compositions
• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)

zbMATH Keywords

digraphtournamentlongest pathpath partition conjecturenearly tournament

Mathematics Subject Classification ID

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

Cited In (10)

• Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
• The directed path partition conjecture
• Miscellaneous Digraph Classes
• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
• Digraphs with the path‐merging property
• Quasi-Transitive Digraphs and Their Extensions
• Longest path partitions in generalizations of tournaments
• Extended path partition conjecture for semicomplete and acyclic compositions
• The path partition conjecture is true for claw-free graphs
• On Linial's conjecture for spine digraphs

This page was built for publication: The Path Partition Conjecture is true for some generalizations of tournaments

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