<?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=51886"><dc:title>Wang, Hong(1-ID): Packing two copies of a sparse graph into a graph with restrained maximum degree. (English summary). - J. Graph Theory 62 (2009), no. 2, 178-187</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><dc:date>2010</dc:date><dc:date>2015-07-10 15:21:20</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51886</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>