Publications at the Institute of Mathematics

Results: 2081
Created on: Sat, 04 May 2024 23:11:46 +0200 in 0.1195 sec


Babovsky, Hans; Görsch, Daniel; Schilder, Frank
Steady kinetic boundary value problems. - In: Lecture notes on the discretization of the Boltzmann equation, (2003), S. 133-157

Böhme, Thomas; Heyer, Gerhard; Unger, Herwig
Innovative internet community systems : third international workshop ; revised papers. - Berlin : Springer, 2003. - VIII, 262 S.. - (Lecture notes in computer science ; 2877) ISBN 3-540-20436-9
Includes bibliographical references and index

Babovsky, Hans;
A kinetic multiscale model. - In: Mathematical models and methods in applied sciences (M 3 AS), ISSN 1793-6314, Bd. 12 (2002), 3, S. 309-332

https://doi.org/10.1142/S0218202502001611
Görsch, Daniel;
Generalized discrete velocity models. - In: Mathematical models and methods in applied sciences (M 3 AS), ISSN 1793-6314, Bd. 12 (2002), 2, S. 49-75

https://doi.org/10.1142/S0218202502001544
Kratochvíl, Jan; Tuza, Zsolt; Voigt, Margit
On the b-chromatic number of graphs. - In: Graph-Theoretic Concepts in Computer Science, (2002), S. 310-320

https://doi.org/10.1007/3-540-36379-3_27
Gerlach, Tobias; Harant, Jochen;
A note on domination in bipartite graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 2, S. 229-231

https://doi.org/10.7151/dmgt.1171
Göring, Frank;
A proof of Menger's theorem by contraction. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 111-112

https://doi.org/10.7151/dmgt.1161
Fowler, Patrick W.; John, Peter E.;
Dürer polyhedra: the dark side of Melancholia. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 101-109

https://doi.org/10.7151/dmgt.1160
Dobrynin, Andrey A.; Melnikov, Leonid S.; Schreyer, Jens; Walther, Hansjoachim
Some news about oblique graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 39-50

A k-gon alpha of a polyhedral graph G(V,E,F) is of type <b1,b2,...,bk> if the vertices incident with alpha in cyclic order have degrees b1, b2,...,bk and <b1,b2,...,bk>$ is the lexicographic minimum of all such sequences available for alpha. A polyhedral graph G is oblique if it has no two faces of the same type. Among others it is shown that an oblique graph contains vertices of degree 3.



https://doi.org/10.7151/dmgt.1157
Kostochka, Alexandr V.; Stiebitz, Michael;
A list version of Dirac's theorem on the number of edges in colour-critical graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 39 (2002), 3, S. 165-177

https://doi.org/10.1002/jgt.998