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: Lecture Notes in Computer Science, cartea 4381
Editat de Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yuen Limba Engleză Paperback – 26 ian 2007
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 321.03 lei
Preț vechi: 401.30 lei
-20% Nou
Puncte Express: 482
Preț estimativ în valută:
56.80€ • 66.78$ • 49.75£
56.80€ • 66.78$ • 49.75£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540706656
ISBN-10: 3540706658
Pagini: 300
Ilustrații: XI, 289 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540706658
Pagini: 300
Ilustrații: XI, 289 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.