Niche number four


AbstractIt 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

Similar works

Full text


Elsevier - Publisher Connector

Provided a free PDF
Last time updated on 5/6/2017View original full text link

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.