<?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>Eischen Ellen E.: Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter. Discrete Math. 306 (2006), no. 8-9, 745-761</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><dc:subject>almost complete tripartite graph</dc:subject><dc:subject>isomorphic factors</dc:subject><dc:subject>graph decomposition</dc:subject><dc:date>2006</dc:date><dc:date>2012-05-31 10:50:40</dc:date><dc:type>Neznano</dc:type><dc:identifier>25826</dc:identifier><dc:identifier>UDK: 519.17(049.3)</dc:identifier><dc:identifier>COBISS_ID: 11586582</dc:identifier><dc:identifier>ISSN pri članku: Y505-9674</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:PETMOK2Y</dc:identifier><dc:language>sl</dc:language></metadata>
