<?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>Nebesk'y Ladislav: Signpost systems and spanning trees of graphs, Czechoslovak Math. J. 56(131) (2006), no. 3, 885-893.</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><dc:subject>signpost system</dc:subject><dc:subject>path</dc:subject><dc:subject>connected graph</dc:subject><dc:subject>tree</dc:subject><dc:subject>spanning tree</dc:subject><dc:date>2006</dc:date><dc:date>2012-05-31 10:50:26</dc:date><dc:type>Neznano</dc:type><dc:identifier>25822</dc:identifier><dc:identifier>UDK: 519.17:54(049.3)</dc:identifier><dc:identifier>COBISS_ID: 11585046</dc:identifier><dc:identifier>ISSN pri članku: Y505-9674</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:6FHBE7WB</dc:identifier><dc:language>sl</dc:language></metadata>
