<?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>Splittable and unsplittable graphs and configurations</dc:title><dc:creator>Bašić,	Nino	(Avtor)
	</dc:creator><dc:creator>Grošelj,	Jan	(Avtor)
	</dc:creator><dc:creator>Grünbaum,	Branko	(Avtor)
	</dc:creator><dc:creator>Pisanski,	Tomaž	(Avtor)
	</dc:creator><dc:subject>configuration of points and lines</dc:subject><dc:subject>unsplittable configuration</dc:subject><dc:subject>unsplittable graph</dc:subject><dc:subject>independent set</dc:subject><dc:subject>Levi graph</dc:subject><dc:subject>Grünbaum graph</dc:subject><dc:subject>splitting type</dc:subject><dc:subject>cyclic Haar graph</dc:subject><dc:description>We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic ▫$(n_3)$▫ configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability. Finally, we show that all cyclic flag-transitive configurations with the exception of the Fano plane and the Möbius-Kantor configuration are splittable.</dc:description><dc:date>2019</dc:date><dc:date>2022-01-03 19:04:23</dc:date><dc:type>Neznano</dc:type><dc:identifier>17632</dc:identifier><dc:identifier>UDK: 519.14</dc:identifier><dc:identifier>ISSN pri članku: 1855-3966</dc:identifier><dc:identifier>DOI: 10.26493/1855-3974.1467.04b</dc:identifier><dc:identifier>COBISS.SI-ID: 18699097</dc:identifier><dc:language>sl</dc:language></metadata>
