On degree sum conditions for directed path-factors with a specified number of paths
From MaRDI portal
Publication:2005702
DOI10.1016/J.DISC.2020.112114zbMATH Open1448.05086OpenAlexW3083664609MaRDI QIDQ2005702FDOQ2005702
Authors: Shuya Chiba, Eishi Mishio, 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
Recommendations
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- \(\vec {P}_{2k+1}\)-factorization of symmetric complete bipartite multi-digraphs.
- \(P_v\)-factorization of symmetric complete bipartite digraphs
- A degree sum condition for the existence of a path-factor.
- A Chvátal-Erdős condition for (1,1)-factors in digraphs
Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Cites Work
- Note on Hamilton Circuits
- On a Hamiltonian cycle in which specified vertices are uniformly distributed
- Recent advances on the Hamiltonian problem: survey III
- Title not available (Why is that?)
- Sufficient Conditions for Circuits in Graphs†
- Advances on the Hamiltonian problem -- a survey
- Title not available (Why is that?)
- Degree conditions for 2-factors
- Cycles in digraphs– a survey
- Long paths and cycles in oriented graphs
- Long Cycles in Digraphs
- Partitioning a graph into vertex-disjoint paths
- Degrees and cycles in digraphs
- On 2-factors containing 1-factors in bipartite graphs
- Longest paths in digraphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- 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
Cited In (5)
- Title not available (Why is that?)
- Degree sums and path-factors in graphs
- Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
- Ramsey-type results for path covers and path partitions. II: Digraphs
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
This page was built for publication: On degree sum conditions for directed path-factors with a specified number of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2005702)
