A Note Related to Graph Theory

Abstract

This article foucuses on (P3 P2,K4)-free graph. In this paper, we prove that if G is (P3 P2,K4)-free, then (G) 7. We then use our result to obtain the upper bound of order and chromatic number of (4K1,P3 P2,Kω)-free graph .

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…