On vertex-disjoint triangles in tripartite graphs and multigraphs
From MaRDI portal
Publication:2227977
DOI10.1007/s00373-020-02188-3zbMath1458.05127OpenAlexW3033876040MaRDI QIDQ2227977
Jiawang Li, Qingsong Zou, Zizheng Ji
Publication date: 16 February 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02188-3
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- On directed versions of the Corrádi-Hajnal corollary
- On the maximum number of independent cycles in a graph
- On the existence of disjoint cycles in a graph
- On the maximum number of independent cycles in a bipartite graph
- On vertex-disjoint cycles and degree sum conditions
- On the maximal number of independent circuits in a graph
This page was built for publication: On vertex-disjoint triangles in tripartite graphs and multigraphs