<?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=49371"><dc:title>Partial cubes are distance graphs</dc:title><dc:creator>Gorše Pihler,	Melita	(Avtor)
	</dc:creator><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>razdaljni graf</dc:subject><dc:subject>delna kocka</dc:subject><dc:subject>hiperkocka</dc:subject><dc:subject>izometrični podgraf</dc:subject><dc:subject>vložitev</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>distance graph</dc:subject><dc:subject>partial cube</dc:subject><dc:subject>hypercube</dc:subject><dc:subject>isometric subgraph</dc:subject><dc:subject>embedding</dc:subject><dc:subject/><dc:description>Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi dvodelni grafi razdaljni grafi. V tem članku pokažemo, da so vsi grafi podmnožice dvodelnih grafov, in sicer delne kocke, razdaljni grafi.</dc:description><dc:date>2005</dc:date><dc:date>2015-07-10 12:00:17</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>49371</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>