04837nam 22008655 450 99646550770331620230406061813.01-280-93576-697866109357653-540-70666-610.1007/978-3-540-70666-3(CKB)1000000000478476(EBL)3061545(SSID)ssj0000139823(PQKBManifestationID)11134441(PQKBTitleCode)TC0000139823(PQKBWorkID)10028262(PQKB)10597396(DE-He213)978-3-540-70666-3(MiAaPQ)EBC3061545(MiAaPQ)EBC6698731(Au-PeEL)EBL6698731(PPN)123159962(EXLCZ)99100000000047847620100301d2007 u| 0engur|n|---|||||txtccrDiscrete 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 Yu1st ed. 2007.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2007.1 online resource (297 p.)Theoretical Computer Science and General Issues,2512-2029 ;4381"Papers of the China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005)"--Pref.Conference name varies widely.3-540-70665-8 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;4381Computer science—MathematicsDiscrete mathematicsComputer graphicsAlgorithmsArtificial intelligence—Data processingConvex geometryDiscrete geometryDiscrete Mathematics in Computer ScienceComputer GraphicsAlgorithmsData ScienceConvex and Discrete GeometryComputer science—Mathematics.Discrete mathematics.Computer graphics.Algorithms.Artificial intelligence—Data processing.Convex geometry.Discrete geometry.Discrete Mathematics in Computer Science.Computer Graphics.Algorithms.Data Science.Convex and Discrete Geometry.516/.13Akiyama J.CJCDGCGT 2005MiAaPQMiAaPQMiAaPQBOOK996465507703316Discrete Geometry, Combinatorics and Graph Theory772193UNISA