Skip to main content
  • Conference proceedings
  • © 2007

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4381)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): CJCDGCGT: China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory

Conference proceedings info: CJCDGCGT 2005.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (30 papers)

  1. Front Matter

  2. Infinite Series of Generalized Gosper Space Filling Curves

    • Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura
    Pages 1-9
  3. An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs

    • Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
    Pages 21-29
  4. On Convex Quadrangulations of Point Sets on the Plane

    • V. M. Heredia, J. Urrutia
    Pages 38-46
  5. Coverage Problem of Wireless Sensor Networks

    • G. L. Lan, Z. M. Ma, S. S. Sun
    Pages 88-100
  6. Some Topics on Edge-Coloring

    • Guizhen Liu, Changqing Xu
    Pages 101-108
  7. Hamiltonicity of Complements of Total Graphs

    • Guoyan Ma, Baoyindureng Wu
    Pages 109-119
  8. Isolated Toughness and Existence of f-Factors

    • Yinghong Ma, Qinglin Yu
    Pages 120-129
  9. A Note on the Integrity of Middle Graphs

    • Aygul Mamut, Elkin Vumar
    Pages 130-134
  10. Indecomposable Coverings

    • János Pach, Gábor Tardos, Géza Tóth
    Pages 135-148
  11. The Decycling Number of Cubic Planar Graphs

    • Narong Punnim
    Pages 149-161
  12. Rotational Steiner Ratio Problem Under Uniform Orientation Metrics

    • Songpu Shang, Xiaodong Hu, Tong Jing
    Pages 166-176
  13. Two Classes of Simple MCD Graphs

    • Yong-Bing Shi, Yin-Cai Tang, Hua Tang, Ling-Liu Gong, Li Xu
    Pages 177-188

Other Volumes

  1. Discrete Geometry, Combinatorics and Graph Theory

Keywords

  • Graph
  • Graph theory
  • Sim
  • algorithm
  • algorithmic geometry
  • algorithms
  • combinatorial mathematics
  • computational geometry
  • computational graph theory
  • convex geometry
  • convex polygons
  • discrete geometry
  • graph transformations
  • lattice
  • vertices
  • algorithm analysis and problem complexity
  • data structures

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions