Personnaliser

OK

Combinatorial Geometry and Graph Theory -

Note : 0

0 avis
  • Soyez le premier à donner un avis

Vous en avez un à vendre ?

Vendez-le-vôtre
Aucun vendeur ne propose ce produit

Soyez informé(e) par e-mail dès l'arrivée de cet article

Créer une alerte prix
Publicité
 
Vous avez choisi le retrait chez le vendeur à
  • Payez directement sur Rakuten (CB, PayPal, 4xCB...)
  • Récupérez le produit directement chez le vendeur
  • Rakuten vous rembourse en cas de problème

Gratuit et sans engagement

Félicitations !

Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !

En savoir plus

Retour

Horaires

      Note :


      Avis sur Combinatorial Geometry And Graph Theory Format Broché  - Livre Informatique

      Note : 0 0 avis sur Combinatorial Geometry And Graph Theory Format Broché  - Livre Informatique

      Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.


      Présentation Combinatorial Geometry And Graph Theory Format Broché

       - Livre Informatique

      Livre Informatique - 01/01/2005 - Broché - Langue : Anglais

      . .

    • Editeur : Springer-Verlag Gmbh
    • Langue : Anglais
    • Parution : 01/01/2005
    • Format : Moyen, de 350g à 1kg
    • Nombre de pages : 240
    • Expédition : 371
    • Dimensions : 23.5 x 15.5 x 14.0
    • ISBN : 3540244018



    • Résumé :
      This volume consists of the refereed papers presented at the Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory (IJCCGGT 2003), held on September 13?16, 2003 at ITB, Bandung, Indonesia. This conf- ence can also be considered as a series of the Japan Conference on Discrete and Computational Geometry (JCDCG), which has been held annually since 1997. The ?rst ?ve conferences of the series were held in Tokyo, Japan, the sixth in Manila, the Philippines, in 2001, and the seventh in Tokyo, Japan in 2002. The proceedings of JCDCG 1998, JCDCG 2000 and JCDCG 2002 were p- lished by Springer as part of the series Lecture Notes in Computer Science: LNCS volumes 1763, 2098 and 2866, respectively. The proceedings of JCDCG 2001 were also published by Springer as a special issue of the journal Graphs and Combinatorics, Vol. 18, No. 4, 2002. TheorganizersaregratefultotheDepartmentofMathematics,InstitutTek- logi Bandung (ITB) and Tokai University for sponsoring the conference. We also thank all program committee members and referees for their excellent work. Our big thanks to the principal speakers: Hajo Broersma, Mikio Kano, Janos Pach andJorgeUrrutia.Finally,ourthanksalsogoestoallourcolleagueswhoworked hard to make the conference enjoyable and successful. August 2004 Jin Akiyama Edy Tri Baskoro Mikio Kano Organization The Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory (IJCCGGT) 2003 was organized by the Department of Mathematics, InstitutTeknologiBandung(ITB)IndonesiaandRIED,TokaiUniversity,Japan.

      Sommaire:
      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....

      Le choixNeuf et occasion
      Minimum5% remboursés
      La sécuritéSatisfait ou remboursé
      Le service clientsÀ votre écoute
      LinkedinFacebookTwitterInstagramYoutubePinterestTiktok
      visavisa
      mastercardmastercard
      klarnaklarna
      paypalpaypal
      floafloa
      americanexpressamericanexpress
      Rakuten Logo
      • Rakuten Kobo
      • Rakuten TV
      • Rakuten Viber
      • Rakuten Viki
      • Plus de services
      • À propos de Rakuten
      Rakuten.com