Abstract
Let and be two disjoint graphs. The union is a graph with vertex set and edge set , and the join is a graph with vertex set and edge set $E(F_1)\cup E(F_2)\cup \{xy\;|\; x\in V(F_1)\mbox{ and } y\in V(F_2)\}$. In this paper, we present a characterization to -free graphs, prove that if is -free. Based on this result, we further prove that max if is a -free graph, and construct an infinite family of -free graphs such that every graph in the family satisfies .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.