<?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=65334"><dc:title>Arboreal structure and regular graphs of median-like classes</dc:title><dc:creator>Brešar,	Boštjan	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>median graph</dc:subject><dc:subject>tree</dc:subject><dc:subject>gatedness</dc:subject><dc:subject>amalgam</dc:subject><dc:subject>periphery</dc:subject><dc:subject>regular graph</dc:subject><dc:description>We consider classes of graphs that enjoy the following properties: they are closed for gated subgraphs, gated amalgamation and Cartesian products, and for any gated subgraph the inverse of gate function maps vertices to gated subsets. We prove that any graph of such a class contains a peripheral subgraph which is a Cartesian product of two graphs: a gated subgraph and a prime graph minus a vertex. Therefore, these graphs admit a peripheral elimination procedure which is a generalization of analogous procedure in median graphs. We characterize regular graphs of these classes whenever they enjoy an additional properties. As a corollary we derive that regular weakly median graphs are precisely Cartesian products in which each factor is a complete graph or a hyperoctahedron.</dc:description><dc:date>2003</dc:date><dc:date>2017-03-31 10:02:24</dc:date><dc:type>Neznano</dc:type><dc:identifier>65334</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
