Topics in Combinatorics and Graph Theory
Home > Mathematics and Science Textbooks > Mathematics > Discrete mathematics > Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel
Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel

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

|
     0     
5
4
3
2
1




International Edition


About the Book

Graph Theory is a part of discrete mathematics characterized by the fact of an extremely rapid development during the last 10 years. The number of graph theoretical paper as well as the number of graph theorists increase very strongly. The main purpose of this book is to show the reader the variety of graph theoretical methods and the relation to combinatorics and to give him a survey on a lot of new results, special methods, and interesting informations. This book, which grew out of contributions given by about 130 authors in honour to the 70th birthday of Gerhard Ringel, one of the pioneers in graph theory, is meant to serve as a source of open problems, reference and guide to the extensive literature and as stimulant to further research on graph theory and combinatorics.

Table of Contents:
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-SymmetricHypergraphs.- 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.


Best Sellers


Product Details
  • ISBN-13: 9783642469107
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 244 mm
  • No of Pages: 792
  • Returnable: Y
  • Width: 170 mm
  • ISBN-10: 3642469108
  • Publisher Date: 29 Mar 2012
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: Essays in Honour of Gerhard Ringel


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Topics in Combinatorics and Graph Theory: Essays in Honour of Gerhard Ringel
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

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

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!