Vai al contenuto principale della pagina
Titolo: |
Discrete Geometry, Combinatorics and Graph Theory [[electronic resource] ] : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
Edizione: | 1st ed. 2007. |
Descrizione fisica: | 1 online resource (297 p.) |
Disciplina: | 516/.13 |
Soggetto topico: | Computer science—Mathematics |
Discrete mathematics | |
Computer graphics | |
Algorithms | |
Artificial intelligence—Data processing | |
Convex geometry | |
Discrete geometry | |
Discrete Mathematics in Computer Science | |
Computer Graphics | |
Data Science | |
Convex and Discrete Geometry | |
Persona (resp. second.): | AkiyamaJ |
Note generali: | "Papers of the China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005)"--Pref. |
Conference name varies widely. | |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Titolo autorizzato: | Discrete Geometry, Combinatorics and Graph Theory ![]() |
ISBN: | 1-280-93576-6 |
9786610935765 | |
3-540-70666-6 | |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465507703316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |