Skip to main content
SpringerLink
Log in
Book cover

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

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Jin Akiyama
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. William Y. C. Chen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mikio Kano
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Xueliang Li
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Qinglin Yu
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: CJCDGCGT 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. Infinite Series of Generalized Gosper Space Filling Curves

    • Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura
    Pages 1-9

  3. Contractible Edges in a k-Connected Graph

    • Kiyoshi Ando
    Pages 10-20

  4. An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs

    • Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
    Pages 21-29

  5. On the Choice Numbers of Some Complete Multipartite Graphs

    • G. L. Chia, V. L. Chia
    Pages 30-37

  6. On Convex Quadrangulations of Point Sets on the Plane

    • V. M. Heredia, J. Urrutia
    Pages 38-46

  7. Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs

    • Lin Hu, Xueliang Li
    Pages 47-58

  8. Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order

    • Hiro Ito
    Pages 59-69

  9. A Neighborhood Condition for Graphs to Have [a, b]-Factors III

    • M. Kano, Haruhide Matsuda
    Pages 70-78

  10. General Balanced Subdivision of Two Sets of Points in the Plane

    • M. Kano, Miyuki Uno
    Pages 79-87

  11. Coverage Problem of Wireless Sensor Networks

    • G. L. Lan, Z. M. Ma, S. S. Sun
    Pages 88-100

  12. Some Topics on Edge-Coloring

    • Guizhen Liu, Changqing Xu
    Pages 101-108

  13. Hamiltonicity of Complements of Total Graphs

    • Guoyan Ma, Baoyindureng Wu
    Pages 109-119

  14. Isolated Toughness and Existence of f-Factors

    • Yinghong Ma, Qinglin Yu
    Pages 120-129

  15. A Note on the Integrity of Middle Graphs

    • Aygul Mamut, Elkin Vumar
    Pages 130-134

  16. Indecomposable Coverings

    • János Pach, Gábor Tardos, Géza Tóth
    Pages 135-148

  17. The Decycling Number of Cubic Planar Graphs

    • Narong Punnim
    Pages 149-161

  18. Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs

    • Xiaoying Qu, Houyuan Lin
    Pages 162-165

  19. Rotational Steiner Ratio Problem Under Uniform Orientation Metrics

    • Songpu Shang, Xiaodong Hu, Tong Jing
    Pages 166-176

  20. Two Classes of Simple MCD Graphs

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

Other volumes

  1. Discrete Geometry, Combinatorics and Graph Theory

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation