How to solve the maximum matching problem determining (0,2)-regular sets

Pacheco, Maria F.; Cardoso, Domingos M.; Luz, Carlos J.

http://hdl.handle.net/10198/17415

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
MiniEuro.pdf		570.81 KB	Adobe PDF	Download

Send Feedback

Authors

Pacheco, Maria F.

Cardoso, Domingos M.

Luz, Carlos J.

Abstract(s)

A (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.

Keywords

Maximum matching (0,2)-Regular sets

URI

http://hdl.handle.net/10198/17415

Citation

Pacheco, 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, Portugal