Akiyama / Chen / Kano | Discrete Geometry, Combinatorics and Graph Theory | Buch | 978-3-540-70665-6 | sack.de

Buch, Englisch, Band 4381, 289 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 960 g

Reihe: Lecture Notes in Computer Science

Akiyama / Chen / Kano

Discrete Geometry, Combinatorics and Graph Theory

7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers
Erscheinungsjahr 2007
ISBN: 978-3-540-70665-6
Verlag: Springer

7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers

Buch, Englisch, Band 4381, 289 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 960 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-70665-6
Verlag: Springer


This book constitutes the thoroughly refereed post-proceedings of the 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory, CJCDGCGT 2005, held in Tianjin, China, as well as in Xi'an, China, in November 2005. The 30 revised full papers address all current issues in discrete algorithmic geometry, combinatorics and graph theory.

Akiyama / Chen / Kano Discrete Geometry, Combinatorics and Graph Theory jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Infinite Series of Generalized Gosper Space Filling Curves.- Contractible Edges in a k-Connected Graph.- An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs.- On the Choice Numbers of Some Complete Multipartite Graphs.- On Convex Quadrangulations of Point Sets on the Plane.- Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs.- Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order.- A Neighborhood Condition for Graphs to Have [a, b]-Factors III.- General Balanced Subdivision of Two Sets of Points in the Plane.- Coverage Problem of Wireless Sensor Networks.- Some Topics on Edge-Coloring.- Hamiltonicity of Complements of Total Graphs.- Isolated Toughness and Existence of f-Factors.- A Note on the Integrity of Middle Graphs.- Indecomposable Coverings.- The Decycling Number of Cubic Planar Graphs.- Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs.- Rotational Steiner Ratio Problem Under Uniform Orientation Metrics.- Two Classes of Simple MCD Graphs.- Core Stability of Flow Games.- The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs.- Three Classes of Bipartite Integral Graphs.- Reconfirmation of Two Results on Disjoint Empty Convex Polygons.- The Binding Number of a Digraph.- The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph.- Fractional Vertex Arboricity of Graphs.- Fitting Triangles into Rectangles.- Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs.- On the Upper Chromatic Numbers of Mixed Interval Hypertrees.- Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.