Some digraph classes that meet the directed path partition conjecture

DOI10.1016/J.DAM.2025.04.048MaRDI QIDQ6969944zbMATH OpenFDO

Authors Jiawen Bo, Zhipeng Gao, Xiaopan Lian, Jianing Liu

Publication date 19 June 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.04.048

zbMATH Keywords

compositiondigraphunicyclic graphlongest pathpath partition conjecture3-quasi-transitive graph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3838057 (Why is no real title available?)
• 4-transitive digraphs. I: The structure of strong 4-transitive digraphs
• A survey of the path partition conjecture
• Extended path partition conjecture for semicomplete and acyclic compositions
• Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
• Longest path partitions in generalizations of tournaments
• On the structure of strong 3-quasi-transitive digraphs
• The Path Partition Conjecture is true for some generalizations of tournaments
• The directed path partition conjecture

This page was built for publication: Some digraph classes that meet the directed path partition conjecture

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