Niche number four

It was shown previously that the minimum-order graph with niche number four has eleven or fewer vertices. We prove here that the smallest graph with niche number four has ten vertices. The proof combines a 10-vertex graph of niche number four with extensive computations which show that no graph with nine or fewer vertices has niche number four.