The Path Partition Conjecture is true for some generalizations of tournaments

DOI10.1016/J.DISC.2012.10.014MaRDI QIDQ1928451zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

digraphlongest pathnearly tournamentpath partition conjecturetournament

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)

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\)

Cited in

(14)

• Linial's conjecture for arc-spine digraphs
• Extended path partition conjecture for semicomplete and acyclic compositions
• Longest path partitions in generalizations of tournaments
• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
• Quasi-transitive digraphs and their extensions
• Miscellaneous digraph classes
• Digraphs with the path‐merging property
• On Linial's conjecture for spine digraphs
• The directed path partition conjecture
• Ramsey-type results for path covers and path partitions. II: Digraphs
• Compositions of digraphs: a survey
• Some digraph classes that meet the directed path partition conjecture
• The path partition conjecture is true for claw-free graphs
• Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach

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)