Pacheco, Maria F.Cardoso, Domingos M.Luz, Carlos J.2018-04-302018-04-302014Pacheco, Maria F.; Cardoso, Domingos; Luz, Carlos (2014). How to solve the maximum matching problem determining (0,2)-regular sets. In XXX EURO mini Conference. Aveiro, Portugalhttp://hdl.handle.net/10198/17415A (K-1)-regular set in a graph is a subset of vertices such that each vertex in the set hask neighbours in it and each vertex not in the set has exactly i neighbours in it.engMaximum matching(0,2)-Regular setsconference object