<?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>Characterizations of minimally tough graphs in some graph classes</dc:title><dc:creator>Ogrin,	Laura	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Mentor)
	</dc:creator><dc:creator>Gollin,	J. Pascal	(Komentor)
	</dc:creator><dc:subject>toughness</dc:subject><dc:subject>minimally tough graph</dc:subject><dc:subject>P4-free graph</dc:subject><dc:subject>complete multipartite graph</dc:subject><dc:subject>co-chordal graph</dc:subject><dc:subject>complement of forest</dc:subject><dc:subject>join of graphs</dc:subject><dc:publisher>L. Ogrin</dc:publisher><dc:date>2025</dc:date><dc:date>2025-09-14 11:30:33</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>21735</dc:identifier><dc:identifier>UDK: 004.42(043.2)</dc:identifier><dc:identifier>COBISS.SI-ID: 248852483</dc:identifier><dc:language>sl</dc:language></metadata>
