Rainbow pancyclicity in graph systems
From MaRDI portal
Publication:2048556
DOI10.37236/9033zbMath1470.05088arXiv1909.11273OpenAlexW4206400500MaRDI QIDQ2048556
Publication date: 6 August 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.11273
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Transversals and bipancyclicity in bipartite graph families ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Rainbow structures in a collection of graphs with degree conditions ⋮ A general approach to transversal versions of Dirac‐type theorems
Cites Work
- Rainbow matchings in bipartite multigraphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- An approximate version of a conjecture of Aharoni and Berger
- Multicoloured Hamilton cycles
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Large rainbow matchings in general graphs
- On a rainbow version of Dirac's theorem
- An Edge-Colored Version of Dirac's Theorem
- A rainbow version of Mantel's Theorem
- A Rainbow Dirac's Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rainbow pancyclicity in graph systems
