The class of {3K<inf>1</inf>, C<inf>4</inf>}-free graphs

Date Issued
01-12-2005
Author(s)
Choudum, S. A.
Shalu, M. A.
Abstract
The problem of finding an optimal upper bound for the chromatic number of 3K1-free graphs is open and quite hard. Approximate bounds are known. Here, we characterize {3K1, C4}-free graphs and deduce that for such a graph G, where ω(G) is the clique number of G.
Volume
32