Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Herstellerkennzeichnung
Die Herstellerinformationen sind derzeit nicht verfügbar.
Inhaltsangabe
A partial census of trivalent generalized Moore networks.- A note on balanced weighing matrices.- The theory of left-right paths.- The graph of the chromial of a graph.- An alternative to the round robin tournament.- Host-parasite relationships.- Computer assisted generation of difference blocks.- Maximal sets of one-factors.- Comparing the shapes of trees.- An amusing proof in fluctuation theory.- "Combination of events" made easy.- Stability and operations on graphs.- Decomposition of complete graphs into 6-stars and into 10-stars.- Some problems in permutation graphs.- On the matrices used to construct baumert-hall arrays.- A conjecture about circuits in planar graphs.- Stability and cacti.- An algorithm for finding the shortest terminal strings which can be produced from non-terminals in context-free grammars.- Some translation planes with elations which are not translations.- All erections of a combinatorial geometry and their automorphism groups.- Nested designs from sum-free sets.- Non-colourable trivalent graphs.
A partial census of trivalent generalized Moore networks.- A note on balanced weighing matrices.- The theory of left-right paths.- The graph of the chromial of a graph.- An alternative to the round robin tournament.- Host-parasite relationships.- Computer assisted generation of difference blocks.- Maximal sets of one-factors.- Comparing the shapes of trees.- An amusing proof in fluctuation theory.- "Combination of events" made easy.- Stability and operations on graphs.- Decomposition of complete graphs into 6-stars and into 10-stars.- Some problems in permutation graphs.- On the matrices used to construct baumert-hall arrays.- A conjecture about circuits in planar graphs.- Stability and cacti.- An algorithm for finding the shortest terminal strings which can be produced from non-terminals in context-free grammars.- Some translation planes with elations which are not translations.- All erections of a combinatorial geometry and their automorphism groups.- Nested designs from sum-free sets.- Non-colourable trivalent graphs.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der buecher.de internetstores GmbH
Geschäftsführung: Monica Sawhney | Roland Kölbl | Günter Hilger
Sitz der Gesellschaft: Batheyer Straße 115 - 117, 58099 Hagen
Postanschrift: Bürgermeister-Wegele-Str. 12, 86167 Augsburg
Amtsgericht Hagen HRB 13257
Steuernummer: 321/5800/1497
USt-IdNr: DE450055826
