Rostocker Mathematisches Kolloquium

SIGLEAvailable from TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Rostocker Mathematisches Kolloquium

Available from TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Some minimum gossip graphs

SIGLEAvailable from TIB Hannover: RN 4052(91708-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Powers of HHD-free graphs

The k-th power of a graph G is the graph with the same vertex set as G where two vertices are adjacent if their distance in G is at most k. In this paper we consider HHD-free graphs, i.e. the graphs where each cycle of length at least five has two chords. We show, that odd powers of HHD-free graphs are again HHD-free, and characterize those HHD-free graphs by forbidden subgraphs for which odd powers are chordal, and even powers are HHD-free or chordal respectively. (orig.)Available from TIB Hannover: RO 1945(315) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Loesung von Differentialgleichungen und singulaere Mannigfaltigkeiten in der dynamischen Simulation von Rad-Schiene-Systemen Abschlussbericht

Available from TIB Hannover: DtF QN1(53,50) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEBundesministerium fuer Bildung, Wissenschaft, Forschung und Technologie, Bonn (Germany)DEGerman

Characterizing minimum gossip graphs on 16 vertices

SIGLEAvailable from TIB Hannover: RN 4052(91707-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Kernels of minimum size gossip schemes 1

The main part of gossip schemes are the kernels of their minimal orders. We give a complete characterization of all kernels that may appear in gossip schemes on simple graphs with a minimum number of calls. As consequences we prove several results of gossip schemes, e.g. the minimum number of rounds of a gossip scheme with a minimum number of calls is computed. Part II covers order theoretic questions for such kernel posets. (orig.)Available from TIB Hannover: RN 4052(92774) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Convexity and HHD-free graphs

It is well-known that chordal graphs can be characterized via m-convexity. In this paper we introduce the notion of m"3-convexity (a relaxation of m-convexity) which is closely related to semisimplicial orderings of graphs. Using this notion we give simpler proofs of results from [8]and present some new characterizations of HHD-free graphs via m"3-convexity of disks. Moreover, we characterize weak bipolarizable graphs as the graphs for which the family of all m"3-convex sets is a convex geometry. As an application of our results we present a simple efficient criterion for deciding whether a HHD-free graph with given vertex radius function r is r-dominated by a clique. (orig.)Available from TIB Hannover: RR 1945(290) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman

Eine Referenzarchitektur fuer multimediale Informationssysteme. Teilprojekt A3: Datenbankunterstuetzung fuer Softwareentwicklungsprozesse

SIGLEAvailable from TIB Hannover: RR 7261(2002,1) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman