<?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>Linear separation of connected dominating sets in graphs</dc:title><dc:creator>Chiarelli,	Nina	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:subject>connected dominating set</dc:subject><dc:subject>connected domination</dc:subject><dc:subject>connected-domishold graph</dc:subject><dc:subject>forbidden induced subgraph characterization</dc:subject><dc:subject>split graph</dc:subject><dc:subject>chordal graph</dc:subject><dc:subject>minimal cutset</dc:subject><dc:subject>minimal separator</dc:subject><dc:subject>1-Sperner hypergraph</dc:subject><dc:subject>threshold hypergraph</dc:subject><dc:subject>threshold Boolean function</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:date>2019</dc:date><dc:date>2019-04-04 08:14:22</dc:date><dc:type>Neznano</dc:type><dc:identifier>11167</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 1855-3966</dc:identifier><dc:identifier>DOI: 10.26493/1855-3974.1330.916</dc:identifier><dc:identifier>COBISS.SI-ID: 1541145284</dc:identifier><dc:language>sl</dc:language></metadata>
