Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Extremal gaps in BP3-designs
Authors: Lucia Gionfriddo
– 0.16 Mb
Abstract
In this paper we examine Voloshin's colorings of mixed hypergraphs derived from P3-designs and construct families of P3-designs having the chromatic spectrum with the leftmost hole and rightmost hole.L.Gionfriddo,
Dipartimento di Matematica e Informatica,
Universia di Catania,
Viale A.Doria, 6 95125 - Catania, Italia.
E-mail:
Dipartimento di Matematica e Informatica,
Universia di Catania,
Viale A.Doria, 6 95125 - Catania, Italia.
E-mail:
Fulltext
– 0.16 Mb
Contents
- Algorithms for minimum flows
- A sensitivity measure of the Pareto set in a vector linfnity-extreme combinatorial problem
- Extremal gaps in BP3-designs
- The Multiobjective Bottleneck Transportation Problem
- Genetic algorithms for the synthesis optimization of a set of irredundant diagnostic tests in the intelligent system
- T-invariants for jumping Petri nets
- Non-commutative computer algebra and molecular computing
- Ekaterina Logvinovna Yushchenko (a tribute in her memory)
