Vor Ort
Merkzettel Warenkorb
  • Produktbild: Topics in Discrete Mathematics
  • Produktbild: Topics in Discrete Mathematics
Band 26

Topics in Discrete Mathematics Dedicated to Jarik Nešetril on the Occasion of his 60th birthday

Aus der Reihe Algorithms and Combinatorics

151,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.11.2010

Abbildungen

XV, 627 p.

Herausgeber

Martin Klazar + weitere

Verlag

Springer Berlin

Seitenzahl

627

Maße (L/B/H)

23,5/15,5/3,5 cm

Gewicht

961 g

Auflage

Softcover reprint of hardcover 1st edition 2006

Sprache

Englisch

ISBN

978-3-642-07026-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

20.11.2010

Abbildungen

XV, 627 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

627

Maße (L/B/H)

23,5/15,5/3,5 cm

Gewicht

961 g

Auflage

Softcover reprint of hardcover 1st edition 2006

Sprache

Englisch

ISBN

978-3-642-07026-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Topics in Discrete Mathematics
  • Produktbild: Topics in Discrete Mathematics
  • Algebra, Geometry, Numbers.- Countable Almost Rigid Heyting Algebras.- Piecewise-Bohr Sets of Integers and Combinatorial Number Theory.- A Generalization of Conway Number Games to Multiple Players.- Two Isoperimetric Problems for Euclidean Simplices.- On Finitely Generated Varieties of Distributive Double p-algebras and their Subquasivarieties.- The F-triangle of the Generalised Cluster Complex.- Ramsey Theory.- Monochromatic Equilateral Right Triangles on the Integer Grid.- One-sided Coverings of Colored Complete Bipartite Graphs.- Nonconstant Monochromatic Solutions to Systems of Linear Equations.- On the Induced Ramsey Number IR(P 3, H).- On Explicit Ramsey Graphs and Estimates of the Number of Sums and Products.- Graphs and Hypergraphs.- Hereditary Properties of Ordered Graphs.- A Proof and Generalizations of the Erd?s-Ko-Rado Theorem Using the Method of Linearly Independent Polynomials.- Unions of Perfect Matchings in Cubic Graphs.- Random Graphs from Planar and Other Addable Classes.- Extremal Hypergraph Problems and the Regularity Method.- Homomorphisms.- Homomorphisms in Graph Property Testing.- Counting Graph Homomorphisms.- Efficient Algorithms for Parameterized H-colorings.- From Graph Colouring to Constraint Satisfaction: There and Back Again.- Graph Colorings.- Thresholds for Path Colorings of Planar Graphs.- Chromatic Numbers and Homomorphisms of Large Girth Hypergraphs.- Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths.- On the Algorithmic Aspects of Hedetniemi’s Conjecture.- Recent Developments in Circular Colouring of Graphs.- Graph Embeddings.- Regular Embeddings of Multigraphs.- Quadrangulations and 5-critical Graphs on the Projective Plane.- Crossing Number of Toroidal Graphs.- Regular Maps on a Given Surface: A Survey.-VII.- On Six Problems Posed by Jarik Nešet?il.