A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs

DOI10.1016/j.disc.2023.113401zbMath1515.05079arXiv2208.09313MaRDI QIDQ6041530

No author found.

Publication date: 31 May 2023

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

Full work available at URL: https://arxiv.org/abs/2208.09313

zbMATH Keywords

disjoint path coverssemicomplete digraphsminimum semi-degree

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Paired many-to-many disjoint path covers in faulty hypercubes
• One-to-one disjoint path covers on alternating group graphs
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Ore-type degree conditions for disjoint path covers in simple graphs
• \(k\)-Ordered Hamilton cycles in digraphs
• One-to-one disjoint path covers in digraphs
• On \(H\)-linked graphs
• Classes of Directed Graphs
• Computing and Combinatorics
• Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
• Degree Conditions for H-Linked Digraphs
• Digraphs

This page was built for publication: A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs