Faktorizace kompletních grafů na langusty s průměrem 4 a pěti nelistovými vrcholy
Loading...
Downloads
2
Date issued
Authors
Mrázek, Tomáš
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoká škola báňská - Technická univerzita Ostrava
Location
Signature
Abstract
The goal of the bachelor thesis is to find out an unknown infinite class of lobsters with five non-leave vertices and diameter 4, which factorize complete graph of order 2n, where n is odd number. Furthermore, part of the bachelor thesis are the citations of necessary conditions and sufficient conditions for factorizations of complete graphs into spanning trees and their applications for a characterization of chosen infinite class of lobsters with five non-leave vertices and diameter 4.
Description
Import 26/06/2013
Subject(s)
factorization, complete graph, spanning tree, lobster