The Path Partition Conjecture is true for some generalizations of tournaments

DOI10.1016/j.disc.2012.10.014zbMath1256.05085OpenAlexW1975303747WikidataQ123365562 ScholiaQ123365562MaRDI QIDQ1928451

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

digraphtournamentlongest pathpath partition conjecturenearly tournament

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)

Related Items (3)

Extended path partition conjecture for semicomplete and acyclic compositions ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ Miscellaneous Digraph Classes

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