Ramsey-type results for path covers and path partitions
From MaRDI portal
Publication:2094874
DOI10.37236/10639zbMath1503.05081arXiv2111.00141OpenAlexW3209718751MaRDI QIDQ2094874
Publication date: 8 November 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.00141
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices
- Forbidden triples and traceability: A characterization
- Characterizing forbidden pairs for hamiltonian properties
- Partition of a graph into cycles and degenerated cycles
- Traceability in graphs with forbidden triples of subgraphs
- On vertex-disjoint paths in regular graphs
- A Ramsey-type theorem for the matching number regarding connected graphs
- A pair of forbidden subgraphs and perfect matchings.
- Forbidden subgraphs for constant domination number
- Covering 2‐connected 3‐regular graphs with disjoint paths
- Paths, Stars and the Number Three
This page was built for publication: Ramsey-type results for path covers and path partitions