Combinatorial Geometry and Graph Theory
Editat de Jin Akiyama, Edy Tri Baskoro, Mikio Kanoen Limba Engleză Paperback – 31 ian 2005
Preț: 318.14 lei
Preț vechi: 397.67 lei
-20% Nou
Puncte Express: 477
Preț estimativ în valută:
56.30€ • 65.65$ • 49.43£
56.30€ • 65.65$ • 49.43£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540244011
ISBN-10: 3540244018
Pagini: 240
Ilustrații: VIII, 227 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.37 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540244018
Pagini: 240
Ilustrații: VIII, 227 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.37 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
On Convex Developments of a Doubly-Covered Square.- Flat 2-Foldings of Convex Polygons.- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph.- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles.- Maximum Induced Matchings of Random Regular Graphs.- Antimagic Valuations for the Special Class of Plane Graphs.- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems.- Crossing Numbers and Skewness of Some Generalized Petersen Graphs.- Some Conditions for the Existence of (d,k)-Digraphs.- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs.- On a Triangle with the Maximum Area in a Planar Point Set.- A Balanced Interval of Two Sets of Points on a Line.- Spanning Trees of Multicoloured Point Sets with Few Intersections.- Regular Factors Containing a Given Hamiltonian Cycle.- Disjoint Edges in Topological Graphs.- The Decycling Number of Cubic Graphs.- Equal Area Polygons in Convex Bodies.- Maximum Order of Planar Digraphs.- (a,d)-Edge-Antimagic Total Labelings of Caterpillars.- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels.- Constructions for Nonhamiltonian Burkard-Hammer Graphs.- A Characterization of Polygonal Regions Searchable from the Boundary.- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.