<?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>Domination and independence numbers of large 2-crossing-critical graphs</dc:title><dc:creator>Iršič Chenoweth,	Vesna	(Avtor)
	</dc:creator><dc:creator>Lekše,	Maruša	(Avtor)
	</dc:creator><dc:creator>Pačnik,	Miha	(Avtor)
	</dc:creator><dc:creator>Podlogar,	Petra	(Avtor)
	</dc:creator><dc:creator>Praček,	Martin	(Avtor)
	</dc:creator><dc:subject>crossing-critical graphs</dc:subject><dc:subject>domination number</dc:subject><dc:subject>independence number</dc:subject><dc:description>After 2-crossing-critical graphs were characterized in 2016, their most general subfamily, large 3-connected 2-crossing-critical graphs, has attracted separate attention. This paper presents sharp upper and lower bounds for their domination and independence number.</dc:description><dc:date>2023</dc:date><dc:date>2024-04-09 08:30:02</dc:date><dc:type>Neznano</dc:type><dc:identifier>18635</dc:identifier><dc:identifier>UDK: 519.172</dc:identifier><dc:identifier>ISSN pri članku: 1855-3966</dc:identifier><dc:identifier>DOI: 10.26493/1855-3974.2853.b51</dc:identifier><dc:identifier>COBISS_ID: 146196483</dc:identifier><dc:language>sl</dc:language></metadata>
