Degree conditions for the partition of a graph into triangles and quadrilaterals

For two positive integers $r$ and $s$ with $r\geq 2s-2$, if $G$ is a graph of order $3r+4s$ such that $d(x)+d(y)\geq 4r+4s$ for every $xy\not\in E(G)$, then $G$ independently contains $r$ triangles and $s$ quadrilaterals, which partially prove the El-Zahar's Conjecture.

No reviews yet.

No comments yet.