<?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>Vertex cover at distance on H-free graphs</dc:title><dc:creator>Dallard,	Clément Jean	(Avtor)
	</dc:creator><dc:creator>Krbezlija,	Mirza	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:subject>distance-k vertex cover</dc:subject><dc:subject>H-free graph</dc:subject><dc:subject>np-completeness</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>dichotomy</dc:subject><dc:date>2021</dc:date><dc:date>2021-07-16 09:00:12</dc:date><dc:type>Neznano</dc:type><dc:identifier>16784</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 0302-9743</dc:identifier><dc:identifier>OceCobissID: 69934851</dc:identifier><dc:identifier>DOI: 10.1007/978-3-030-79987-8_17</dc:identifier><dc:identifier>COBISS.SI-ID: 69936899</dc:identifier><dc:language>sl</dc:language></metadata>
