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
Isomorphism problems for hypergraphs.- Nombres de coloration de l'hypergraphe h-parti complet.- The coloring numbers of the direct product of two hypergraphs.- Graphe representatif de l'hypergraphe h-parti complet.- The chromatic index of an infinite complete hypergraph: A partition theorem.- Intersecting families of edges in hypergraphs having the hereditary property.- On theorems of berge and fournier.- Extremal problems on graphs and hypergraphs.- Hypergraph reconstruction.- Une condition pour qu'un hypergraphe, ou son complementaire, soit fortement isomorphe a un hypergraphe complet.- On a property of hypergraphs with no cycles of length greater than two.- Sur les hypergraphes bichromatiques.- Minimax theorems for hypergraphs.- Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets.- Reconstruction theorems for infinite hypergraphs.- Note on a hypergraph extremal problem.- Sur une conjecture de V. Chvatal.- On the chromatic number of the direct product of hypergraphs.- Every directed graph has a semi-kernel.- Elementary strong maps and transversal geometries.- Some problems in graph theory.- Aspects of the theory of hypermatroids.- Facets of I-matching polyhedra.- Chromials.- Some partitions of all triples into steiner triple systems.- Unsolved problems.
Isomorphism problems for hypergraphs.- Nombres de coloration de l'hypergraphe h-parti complet.- The coloring numbers of the direct product of two hypergraphs.- Graphe representatif de l'hypergraphe h-parti complet.- The chromatic index of an infinite complete hypergraph: A partition theorem.- Intersecting families of edges in hypergraphs having the hereditary property.- On theorems of berge and fournier.- Extremal problems on graphs and hypergraphs.- Hypergraph reconstruction.- Une condition pour qu'un hypergraphe, ou son complementaire, soit fortement isomorphe a un hypergraphe complet.- On a property of hypergraphs with no cycles of length greater than two.- Sur les hypergraphes bichromatiques.- Minimax theorems for hypergraphs.- Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets.- Reconstruction theorems for infinite hypergraphs.- Note on a hypergraph extremal problem.- Sur une conjecture de V. Chvatal.- On the chromatic number of the direct product of hypergraphs.- Every directed graph has a semi-kernel.- Elementary strong maps and transversal geometries.- Some problems in graph theory.- Aspects of the theory of hypermatroids.- Facets of I-matching polyhedra.- Chromials.- Some partitions of all triples into steiner triple systems.- Unsolved problems.
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
