collaborators

1 paper

math.CO2021

A note on internal partitions: the -regular case and beyond

Pál Bärnkopf, Zoltán Lóránt Nagy, Zoltán Paulovics

An internal or friendly partition of a graph is a partition of the vertex set into two nonempty sets so that every vertex has at least as many neighbours in its own class as in the…