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 /

Corporate Author: SpringerLink (Online service)
Other Authors: Akiyama, Jin. (Editor, http://id.loc.gov/vocabulary/relators/edt), Chen, William Y.C. (Editor, http://id.loc.gov/vocabulary/relators/edt), Kano, Mikio. (Editor, http://id.loc.gov/vocabulary/relators/edt), Li, Xueliang. (Editor, http://id.loc.gov/vocabulary/relators/edt), Yu, Qinglin. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edition:1st ed. 2007.
Series:Theoretical Computer Science and General Issues ; 4381
Subjects:
Online Access:https://doi.org/10.1007/978-3-540-70666-3
LEADER 04786nam a22006255i 4500
001 978-3-540-70666-3
003 DE-He213
005 20210624180817.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540706663  |9 978-3-540-70666-3 
024 7 |a 10.1007/978-3-540-70666-3  |2 doi 
050 4 |a QA76.9.M35  
072 7 |a PBD  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a PBD  |2 thema 
072 7 |a UYAM  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Discrete Geometry, Combinatorics and Graph Theory  |h [electronic resource] :  |b 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers /  |c edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a XI, 289 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues ;  |v 4381 
505 0 |a 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. 
650 0 |a Computer science—Mathematics. 
650 0 |a Computer graphics. 
650 0 |a Algorithms. 
650 0 |a Data structures (Computer science). 
650 0 |a Convex geometry . 
650 0 |a Discrete geometry. 
650 1 4 |a Discrete Mathematics in Computer Science.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I17028 
650 2 4 |a Computer Graphics.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I22013 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I16021 
650 2 4 |a Data Structures.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/I15017 
650 2 4 |a Convex and Discrete Geometry.  |0 https://scigraph.springernature.com/ontologies/product-market-codes/M21014 
700 1 |a Akiyama, Jin.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Chen, William Y.C.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Kano, Mikio.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Li, Xueliang.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Yu, Qinglin.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540835226 
776 0 8 |i Printed edition:  |z 9783540706656 
830 0 |a Theoretical Computer Science and General Issues ;  |v 4381 
856 4 0 |u https://doi.org/10.1007/978-3-540-70666-3 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)