Opis: We present some results on the harmonious colourings of the Levi graph of a 2-design, focusing on Steiner 2-design. It is easily seen that the harmonious chromatic number of such a Levi graph is at least the number of points of the design: we study and construct Banff designs, that is designs such that this lower bound is attained.Ključne besede: Harmonious chromatic number, Levi graph, combinatorial designObjavljeno v RUP: 03.11.2025; Ogledov: 390; Prenosov: 6 Celotno besedilo (426,74 KB)
Ključne besede: vaccine design, bioinformatics, combinatorial optimization problem, weighted lambda-superstring, integer programming formulation, genetic algorithm, Nef proteinObjavljeno v RUP: 13.02.2019; Ogledov: 6048; Prenosov: 172 Povezava na celotno besedilo
Ključne besede: razvoj cepiv, kombinatorična optimizacija, celoštevilsko programiranje, hevristika "hillclimbing", problem najkrajšega skupnega nadniza, problem pokritja z množicami, vaccine design, combinatorial optimization, integer programming, hill-climbing, shortest common superstring problem, set cover problemObjavljeno v RUP: 15.10.2015; Ogledov: 5186; Prenosov: 147 Povezava na celotno besedilo
