<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>On two extensions of equimatchable graphs</dc:title><dc:creator>Deniz,	Zakir	(Avtor)
	</dc:creator><dc:creator>Ekim,	Tinaz	(Avtor)
	</dc:creator><dc:creator>Hartinger,	Tatiana Romina	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Shalom,	Mordechai	(Avtor)
	</dc:creator><dc:subject>minimum maximal matching</dc:subject><dc:subject>equimatchable graph</dc:subject><dc:subject>edge dominating set</dc:subject><dc:subject>Gallai-Edmonds decomposition</dc:subject><dc:subject/><dc:subject>parameterized complexity</dc:subject><dc:date>2017</dc:date><dc:date>2018-01-29 11:31:00</dc:date><dc:type>Neznano</dc:type><dc:identifier>9454</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 1572-5286</dc:identifier><dc:identifier>OceCobissID: 513620761</dc:identifier><dc:identifier>DOI: 10.1016/j.disopt.2017.08.002</dc:identifier><dc:identifier>COBISS.SI-ID: 1540044996</dc:identifier><dc:language>sl</dc:language></metadata>
