Ramsey-type results for path covers and path partitions. II: Digraphs
From MaRDI portal
Publication:6096342
DOI10.1016/j.amc.2023.128205arXiv2111.14284MaRDI QIDQ6096342
Publication date: 12 September 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.14284
Paths and cycles (05C38) Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden induced subgraphs for bounded \(p\)-intersection number
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
- Longest paths in digraphs
- Forbidden triples and traceability: A characterization
- Characterizing forbidden pairs for hamiltonian properties
- Traceability in graphs with forbidden triples of subgraphs
- New results on maximum induced matchings in bipartite graphs and beyond
- On degree sum conditions for directed path-factors with a specified number of paths
- Ramsey-type results for path covers and path partitions
- A Ramsey-type theorem for the matching number regarding connected graphs
- Berge's conjecture on directed path partitions -- a survey
- Graph Theory
- Long paths and cycles in oriented graphs
- Forbidden subgraphs for constant domination number
- Finding a Longest Path in a Complete Multipartite Digraph
This page was built for publication: Ramsey-type results for path covers and path partitions. II: Digraphs