<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=65348"><dc:title>On [Theta]-graphs of partial cubes</dc:title><dc:creator>Klavžar,	Sandi	(Avtor)
	</dc:creator><dc:creator>Kovše,	Matjaž	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>intersection graph</dc:subject><dc:subject>partial cube</dc:subject><dc:subject>median graph</dc:subject><dc:subject>expansion theorem</dc:subject><dc:subject>Cartesian product of graphs</dc:subject><dc:description>The ▫$\Theta$▫-graph ▫$\Theta(G)$▫ of a partial cube ▫$G$▫ is the intersection graph of the equivalence classes of the Djokovic-Winkler relation. ▫$\Theta$▫-graphs that are 2-connected, trees, or complete graphs are characterized. In particular, ▫$\Theta(G)$▫ is complete if and only if ▫$G$▫ can be obtained from ▫$K_1$▫ by a sequence of (newly introduced) dense expansions. ▫$\Theta$▫-graphs are also compared with familiar concepts of crossing graphs and ▫$\tau$▫-graphs.</dc:description><dc:publisher> University of Zielona Góra</dc:publisher><dc:date>2007</dc:date><dc:date>2017-03-31 14:05:52</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>65348</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
