Tiling tripartite graphs with 3-colorable graphs
From MaRDI portal
Publication:2380267
zbMath1186.05055arXiv0804.4154MaRDI QIDQ2380267
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.4154
Related Items (4)
Minimum degree thresholds for bipartite graph tiling ⋮ Asymptotic multipartite version of the Alon-Yuster theorem ⋮ On multipartite Hajnal-Szemerédi theorems ⋮ Tiling tripartite graphs with 3-colorable graphs: the extreme case
This page was built for publication: Tiling tripartite graphs with 3-colorable graphs