Vor Ort
Merkzettel Warenkorb

Gutscheinbedingungen

**Gültig bis 06.07.2026 auf fremdsprachige Bücher online auf thalia.at, in der Thalia App ab einem Mindestbestellwert von 30€ und in allen Thalia Buchhandlungen in Österreich. In den Buchhandlungen nur gültig auf lagernde Ware. Einzelne Artikel können ausgeschlossen sein. Ausgenommen sind preisgebundene Artikel & eBooks. Pro Einkauf einmal einlösbar. Nur gültig gegen Vorlage oder im Onlineshop hinterlegter Bonuscard. Infos zur Einlösung in der Buchhandlung sind auf der Bonuscard-Vorteilspreisseite zu finden. Click & Collect nur bei Onlinevorabzahlung möglich. Keine Einlösung bei Scan & Go-Bezahlung. Keine Barauszahlung. Nicht kombinierbar mit anderen Aktionen und Gutscheinen. Gutschein wird auf max. 500€ Bestellwert angerechnet. Nicht gültig für Versandkosten und Services.
  • Produktbild: Topics in Combinatorics and Graph Theory
  • Produktbild: Topics in Combinatorics and Graph Theory

Topics in Combinatorics and Graph Theory Essays in Honour of Gerhard Ringel

99,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.03.2012

Herausgeber

Rainer Bodendiek + weitere

Verlag

Physica

Seitenzahl

792

Maße (L/B/H)

24,4/17/4,4 cm

Gewicht

1378 g

Auflage

Softcover reprint of the original 1st ed. 1990

Sprache

Englisch

ISBN

978-3-642-46910-7

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.03.2012

Herausgeber

Verlag

Physica

Seitenzahl

792

Maße (L/B/H)

24,4/17/4,4 cm

Gewicht

1378 g

Auflage

Softcover reprint of the original 1st ed. 1990

Sprache

Englisch

ISBN

978-3-642-46910-7

Herstelleradresse

Physica Verlag
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

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 Combinatorics and Graph Theory
  • Produktbild: Topics in Combinatorics and Graph Theory
  • On the Problem of Relative Components of Minimal Graphs.- Irregular Assignments and Two Problems á la Ringel.- A Recursive Bound for the Number of Complete K-Subgraphs of a Graph.- One-Factorizations of Tensor Products of Graphs.- Non-Commutative Geometry and Graphs.- The Complexity of the Graph Embedding Problem.- Helly Theorems for Dismantlable Graphs and Pseudo-Modular Graphs.- On the Level-Oriented Two-Dimensional Packing with Rotation of the Rectangles.- On Planar Tilings with Finitely Many Sorts of Tiles.- Examples of Space-Tiling Polyhedra Related to Hilbert’s Problem 18, Question 2.- The Historical Background to Gerhard Ringel’s Work.- Around Three Lemmas in Hamiltonian Graph Theory.- A Note on Metric Properties of Infinite Graphs.- Automotphism Groups of Directed Cayley Graphs.- Triangular Embeddings of Tensor Products of Graphs.- Computing Light Edges in Planar Graphs.- On the Domination Problem for Bipartite Graphs.- Polyhedral Maps with Few Edges.- Aut Gm,n for the Hasse Graph Gm,n of the Subword Poset Bm,n of an m-Ary Cyclic Word of Length n.- Status of Graceful Tree Conjecture in 1989.- Embedded Graphs, Facial Colorings, and Double Cycle Covers.- On Peripheral Vertices in Graphs.- The Vertex-Degrees of Steiner Minimal Trees in Minkowski Planes.- Unfolding Weighted Concensus Orders into Consistent Numerical Scales.- Forbidden Ordered Subgraphs.- On Normal Tournaments with the Least Number of 3-Cycles.- Two-Irregular Graphs.- Cell Complexes and Lower Bounds in Computational Geometry.- Characterizing Directed Postman Tours.- Some Properties of “Almost All” Functions from pk.- Composition of Facets of the Clique Partitioning Polytope.- Optimal Edge-Numbering of Binary Trees.- On Independent Vertices and Edges of a Graph.- The Outerthickness & Outercoarseness of Graphs I. the Complete Graph & the n-Cube.- On Some Graphic Aspects of Addition Theorems.- On the Circumference of Regular Polyhedral Graphs.- Longest Cycles in Circulant Graphs.- Spanning Trees of the Complete Bipartite Graph.- A Combinatorial Theorem Which is Related to the Invariance of the Separating Set for the Plane.- On Certain Trees in Hypercubes.- Extending Hall’s Theorem.- On the Coupling Condition and Hamiltonicity.- Transversals and Matroids.- Classification and Construction of Geodetic Block with Diameter Two.- Graph Distances and Similarity.- Witt Rings and Semiorderings of Planar Ternary Rings.- Linear Inequalities Describing the Class of Intersecting Sperner Families of Subsets, I.- Integral Drawings of the Complete Graph K6.- On Certain Binomial Sums.- Colouring of Spider Graphs.- A Las-Vergnas Type Theorem for Trees.- Quick Gossiping by Multi-Telegraphs.- Numberings on Graphs Having Small Edge Weights.- On Vertexminimal Graphs with Radius r and Connectivity 2m.- Embedding Schemes and the Jordan Curve Theorem.- Subgraph Packing — A Survey.- On the Radius of Random Subgraphs of the n-Cube.- A Result in Combinatorial Matroid Theory.- On Graphs Embeqdable with Short Faces.- On Cyclic Representations of Triples by Pairs.- On the Steiner Periphery and Steiner Eccentricity of a Graph.- Cycles Containing Three Consecutive Edges in 2k-Edge-Connected Graphs.- Graph Distance and Euclidean Distance on the Grid.- About the Complexity of Some Homomorphism Problems on Graphs.- On an Inequality of Sperner.- Counting Perfect Matchings in Lattice Graphs.- Genus — Minimal Edges and Kuratowski Subgraphs of a Graph.- From Tree Path-Factors and Doubly Exponential Sequences to a Binomial Inequality.- A Characterization of Point-Colour-Symmetric Hypergraphs.- A Linear Algorithm for the Pathwidth of Trees.- The Time Travelling Problem.- An Aperiodic Triple of Prototiles.- Representation of Graphs by Integers.- Special Systems of Linear Equations and Graphs of Convex Polytopes.- On 2-Embeddable Graphs.- On an Application of the Boolean Differential Calculus to Digital System Theory.- Equtareal Sets in Rd.- On the Piaget Graph.- On a Characterization of Closure Operators by Identities on Semigroups.- Symmetries of Group-Triangulations.- Experimental Mathematics — Tesselations of Convex Polygons in a Hexagonal Lattice.- Domination in Cubic Graphs.- A Generalization of the Bodendiek Conjecture About Graceful Graphs.- A Sparse callai-Witt Theorem.- Edges with at Most One Crossing in Drawings of the Complete Graph.- Long Cycles in Graphs with Moderate Connectivity.- Independent Covers in Plane Graphs.- List of Contributors.