Publikationen

Anzahl der Treffer: 142
Erstellt: Fri, 26 Apr 2024 23:13:32 +0200 in 0.0617 sec


John, Peter; Gutman, Ivan E.
On the calculation of the algebraic structure count of polycyclic conjugated hydrocarbons by means of cell polynomial. - In: Journal of the Serbian Chemical Society, ISSN 0352-5139, Bd. 62 (1997), 4, S. 319-325

Alon, Noga; Tuza, Zsolt; Voigt, Margit
Choosability and fractional chromatic numbers. - In: Discrete mathematics, Bd. 165/166 (1997), S. 31-38

http://dx.doi.org/10.1016/S0012-365X(96)00159-8
Böhme, Thomas; Broersma, Hajo; Göbel, F.; Kostochka, Alexandr V.; Stiebitz, Michael
Spanning trees with pairwise nonadjacent endvertices. - In: Discrete mathematics, Bd. 170 (1997), 1/3, S. 219-222

http://dx.doi.org/10.1016/S0012-365X(96)00306-8
Fleischner, Herbert; Stiebitz, Michael
Some remarks on the cycle plus triangles problem. - In: The mathematics of Paul Erdös, (1997), S. 136-142

Voigt, Margit; Wirth, B.
On 3-colorable non-4-choosable planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 24 (1997), 3, S. 233-235

https://doi.org/10.1002/(SICI)1097-0118(199703)24:3<233::AID-JGT4>3.0.CO;2-Q
Unger, Herwig; Böhme, Thomas
Ein multikriterielles, fuzzybasiertes Lastverteilungssystem. - In: Informatik und Automatisierung im Zeitalter der Informationsgesellschaft ; Bd. 1:[Vortragsreihen / Gens, Wolfgang *1933-*. - Ilmenau : Technische Univ., 1997, (1997), S. 269-274

Manoussakis, Yannis; Spyratos, M.; Tuza, Zsolt; Voigt, Margit
Minimal colorings for properly colored subgraphs. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 12 (1996), 4, S. 345-360

We give conditions on the minimum numberk of colors, sufficient for the existence of given types of properly edge-colored subgraphs in ak-edge-colored complete graph. The types of subgraphs we study include families of internally pairwise vertex-disjoint paths with common endpoints, hamiltonian paths and hamiltonian cycles, cycles with a given lower bound of their length, spanning trees, stars, and cliques. Throughout the paper, related conjectures are proposed.



https://doi.org/10.1007/BF01858468
John, Peter E.; Mallion, Roger B.
Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree. - In: International journal of quantum chemistry, ISSN 1097-461X, Bd. 60 (1996), 1, S. 59-66

https://doi.org/10.1002/(SICI)1097-461X(1996)60:1<59::AID-QUA6>3.0.CO;2-4
Voigt, Margit;
Choosability of planar graphs. - In: Discrete mathematics, Bd. 150 (1996), 1/3, S. 457-460

http://dx.doi.org/10.1016/0012-365X(95)00216-J
Kostochka, Alexandr V.; Stiebitz, Michael; Wirth, B.
The colour theorems of Brooks and Gallai extended. - In: Discrete mathematics, Bd. 162 (1996), 1/3, S. 299-303

http://dx.doi.org/10.1016/0012-365X(95)00294-7