1 dataset found

Tags: monochromatic-domination

Filter Results

  • A new bound for the 2/3 conjecture

    We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these...
You can also access this registry using the API (see API Docs).