On degree sum conditions for directed path-factors with a specified number of paths

DOI10.1016/j.disc.2020.112114zbMath1448.05086OpenAlexW3083664609MaRDI QIDQ2005702

Eishi Mishio, Shuya Chiba, Pierre Montalbano

Publication date: 8 October 2020

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

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

zbMATH Keywords

bipartite graphsdigraphsperfect matchingsdegree conditionsdirected path-factors

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Longest paths in digraphs
• Degrees and cycles in digraphs
• On 2-factors containing 1-factors in bipartite graphs
• Advances on the Hamiltonian problem -- a survey
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• On a Hamiltonian cycle in which specified vertices are uniformly distributed
• Recent advances on the Hamiltonian problem: survey III
• Note on Hamilton Circuits
• Long Cycles in Digraphs
• Cycles in digraphs– a survey
• Long paths and cycles in oriented graphs
• Degree conditions for 2-factors
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
• Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
• Partitioning a graph into vertex-disjoint paths
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: On degree sum conditions for directed path-factors with a specified number of paths