<?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>Strong cliques in diamond-free graphs</dc:title><dc:creator>Chiarelli,	Nina	(Avtor)
	</dc:creator><dc:creator>Martínez-Barona,	Berenice	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Monnot,	Jérôme	(Avtor)
	</dc:creator><dc:creator>Muršič,	Peter	(Avtor)
	</dc:creator><dc:subject>maximal clique</dc:subject><dc:subject>maximal stable set</dc:subject><dc:subject>diamond-free graph</dc:subject><dc:subject>strong clique</dc:subject><dc:subject>simplicial clique</dc:subject><dc:subject>strongly perfect graph</dc:subject><dc:subject>CIS graph</dc:subject><dc:subject>NP-hard problem</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>Erdős-Hajnal property</dc:subject><dc:date>2020</dc:date><dc:date>2020-12-17 12:06:42</dc:date><dc:type>Neznano</dc:type><dc:identifier>14671</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 0304-3975</dc:identifier><dc:identifier>OceCobissID: 26525952</dc:identifier><dc:identifier>DOI: 10.1016/j.tcs.2020.12.001</dc:identifier><dc:identifier>COBISS.SI-ID: 42440451</dc:identifier><dc:language>sl</dc:language></metadata>
