Longest path partitions in generalizations of tournaments

DOI10.1016/j.disc.2006.03.063zbMath1103.05036OpenAlexW2062928364MaRDI 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

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

Related Items (13)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Longest path partitions in generalizations of tournaments