Longest path partitions in generalizations of tournaments

DOI10.1016/j.disc.2006.03.063zbMath1103.05036MaRDI QIDQ2501556

Morten Hegner Nielsen, Anders Yeo, Jörgen Bang-Jensen

Publication date: 14 September 2006

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

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

zbMATH Keywords

quasi-transitive digraphextended semicomplete digraphlocally in-semicomplete digraph

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

Semicomplete compositions of digraphs, k‐quasi‐transitive digraphs of large diameter, Computational results on the traceability of oriented graphs of small order, A note on a cycle partition problem, Cycles in \(k\)-traceable oriented graphs, A linear bound towards the traceability conjecture, Traceability of \(k\)-traceable oriented graphs, On a cycle partition problem, Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs, \(\alpha\)-diperfect digraphs, Extended path partition conjecture for semicomplete and acyclic compositions, Independent sets and non-augmentable paths in generalizations of tournaments, Quasi-Transitive Digraphs and Their Extensions

Cites Work

• Path partitions and \(P_{n}\)-free sets
• Stable set meeting every longest path
• Locally semicomplete digraphs: A generalization of tournaments
• Partition problems and kernels of graphs
• A path(ological) partition problem
• Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
• Quasi‐transitive digraphs
• The directed path partition conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item