二维码
联系我们 IMG_WeChat

btn_Registration

Countdown
31 days

Template for Manuscripts

Important Dates

Conference:

Jul. 19-21, 2019

Full Paper Due: Jun. 17, 2019

Abstract Due: Jun. 17, 2019

Audience Registration Due:
Jul. 19, 2019

The 4th Combinatorics and Graph Theory Conference (CGT 2019) will be held from July 19-21, 2019 in Guilin, China. CGT 2019 will cover issues on Algebraic graph theory, Applications of combinatorics and graph theory, Coding theory, Combinatorial algorithms, Combinatorial designs, Combinatorial matrix theory, Combinatorial optimization, Cryptography, Enumerative combinatorics, Finite geometry, Structure graph theory, Topological graph theory, etc. It dedicates to creating a stage for exchanging the latest research results and sharing the advanced research methods.

Guilin, 'East or west, Guilin landscape is best!' Located in the northeast of Guangxi Zhuang Autonomous Region in south China, Guilin is considered to be the pearl of China's thriving tourist industry on account of the natural beauty and historic treasures. Looking forward to your participation!

Contact Us

Email:  intelconf@163.com
Tel: +86 132 6470 2250
QQ: 1349406763, 3025797047
WeChat: 3025797047 

Speakers
Dr. Simon K.S. Cheung
Dr. Simon K.S. Cheung
The Open University of Hong Kong, China
Prof. Yilun Shang
Prof. Yilun Shang
Northumbria University, UK
Dr. Xin Zhang
Dr. Xin Zhang
Xidian University, China
Prof. Choonkil Park
Prof. Choonkil Park
Hanyang University, Republic of Korea
Prof. Hee Sik Kim
Prof. Hee Sik Kim
Hanyang University, Korea, Republic of Korea
Publication and Presentation

Publication: All the accepted papers will be published by a peer-reviewed open access journal that can ensure the widest dissemination of your published work, for more information, please contact us (intelconf@163.com).

Index: CNKI and Google Scholar  

Note: If you want to present your research results but do NOT wish to publish a paper, you may simply submit an Abstract to our Registration System.

Media Partners
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16