The 8th International Symposium on GraphTheory and Combinatorial Algorithms (GTCA2019)

Date:2019-07-05Clicks:10设置

July 5th

Registration

14:00-20:30

Lobby, Narada Hotel Xuzhou Baoxin

Dinner

18:30-21:00

Room Shuiyunjian

Board Meeting

20:00-21:00

3rd Meeting of the 4th session of BoardMeeting Room 6 (2nd Floor)


July 6th, 2019.

8:30-12:10 Multi-Function Hall (1st Floor)

Opening ceremony

Chair: Xujin Chen

8:30-8:40

Address by Professor Miao Zhengke, the Vice President of Jiangsu Normal University

8:40-8:50

Address by Research Fellow Hu Xudong, councilor of the Board

8:50-9:00

Professor Guo Tiande, councilor of the Divided Borad

Plenary talk

Chair: Jixiang Meng  

9:00-9:45

Cocolouring, bichromatic number, and Ferrers diagram representations

Jing Huang, University of Victoria

Break

9:45-10:15

Group Photo

Plenary talks

Chair: Heping Zhang

10:15-11:00

Optimization in Biodata

Guojun Li, Shandong University

11:00-11:45

Cutting strips and their applications

Arthur L.B. Yang, Nankai University

Host: Guo Tiande

11:45-12:10

General Election

Lunch

12:10-13:40

Room Shuiyunjian

Session 1 (14:00-18:00) Meeting Room 7 (-1st Floor)

Invited talks

Chair: Liying Kang

14:00-14:30

Decomposition of a planar graph into a forest and a 3-choosable subgraph

Ringi Kim, Korea Advanced Institute of Science and Technology

14:30-15:00

On partitions of K2,3-free graphs under degree constraints

Jianfeng Hou, Fuzhou University

15:00-15:30

Phase transition in random hypergraphs

Xing Peng, Tianjin University

15:30-16:00

Nearly perfect matchings in uniform hypergraphs

Hongliang Lu, Xi’an Jiaotong University

Break

16:00-16:15


Contributed talks

Chair: Shenggui Zhang

16:15-16:30

The anti-Ramsey numbers of some special hypergraphs

Ran Gu, Hohai University

16:30-16:45

Asymptotic enumeration of linear hypergraphs with given number of vertices and edges

Fang Tian, Shanghai University of Finance and Economics

16:45-17:00

Domination in intersecting hypergraphs

Yanxia Dong, Shanghai University of International Business and Economics

17:00-17:15

Fractional Gallai-Edmonds decomposition and saturated graphs on fractional matching number

Yan Liu, South China Normal University

17:15-17:30

Perfect matching transitive graphs

Ju Zhou, Kutztown Univcersity of PA

17:30-17:45

Perfect matching covers of cubic graphs

Wuyang Sun, Shandong University

17:45-18:00

A new proof on the Ramsey number of matchings

Hongna Yang, Northwestern Polytechnical University

Session 2 (14:00-18:00) Meeting Room 8 (-1st Floor)

Invited talks

Chair: Yi Wang

14:00-14:30

Decomposition of edge-colored digraphs and its applications

Xiande Zhang, University of Science and Technology of China

14:30-15:00

Repairable allocation padding design and its applications

Zihong Tian, Hebei Normal University

15:00-15:30

Location of roots of graph polynomials

Li Liu, Qufu Normal University

15:30-16:00

Conflict-avoiding codes and their graphical representations

Yuan-Hsun Lo, Xiamen University

Break

16:00-16:15


Contributed talks

Chair: Yaojun Chen

16:15-16:30

Planar graphs without 4- and 6-cycles are (7 : 2)-colorable

Xiaolan Hu, Central China Normal University

16:30-16:45

Polychromatic colorings of plane graphs

Xia Zhang, Shandong Normal University

16:45-17:00

Vertex-critical (P5, banner)-free Graphs

Qingqiong Cai, Nankai University

17:00-17:15

r-dynamic coloring of graphs

Junlei Zhu, Jiaxing University

17:15-17:30

Edge coloring of signed graphs

Li Zhang, Northwestern Polytechnical University

17:30-17:45

On list 3-dynamic coloring of near-triangulations

Yulai Ma, Nankai University

17:45-18:00

A note on chromatic number of (cap, even hole)-free graphs

Rong Wu, Nanjing Normal University

Session 3 (14:00-18:00) Meeting Room 9 (-1st Floor)

Invited talks

Chair: Zhao Zhang

14:00-14:30

Birds of a feather flock together: modular decomposition and its algorithmic applications

Yixin Cao, Hong Kong Polytechnic University

14:30-15:00

Distributed dominating set and connected dominating set construction in the dynamic SINR Mode

Yong Zhang, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences

15:00-15:30

Data mining from the perspective of network science and graph theory

Xingqin Qi, Shandong University, Weihai

15:30-16:00

Approximation algorithms for partial inverse maximum spanning tree problem

Xianyue Li, Lanzhou University

Break

16:00-16:15


Contributed talks

Chair: Yizheng Fan

16:15-16:30

Star complement technique in graph spectrum theory

Xiying Yuan, Shanghai University

16:30-16:45

Spanning tree packing number and eigenvalues of graphs with given girth

Ruifang Liu, Zhengzhou University

16:45-17:00

A spectral characterization of the s-clique extension of the triangular graphs

Yingying Tan, Anhui Jianzhu University

17:00-17:15

Some new results about graphs determined by their generalized spectrum

Lihong Qiu, Xi’an Jiaotong University

17:15-17:30

Brauer-type eigenvalue inclusion sets of   stochastic/irreducible tensors and positive definiteness of tensors

Chunli Deng, Harbin Engineering University

17:30-17:45

Arc-disjoint strong spanning subdigraphs in digraphs

Yuefang Sun, Shaoxing University

17:45-18:00

Vertex-disjoint cycles in bipartite graphs with partial degrees

Suyun Jiang , Jianghan University

Dinner

18:00-20:00

Room Shuiyunjian

Board Meeting

20:00-21:30

1st Meeting of the 5th session of the Board, Meeting Hall 6


July 7th, 2019.

8:30-11:50Multi-Function Room (1st Floor)

Plenary  talks

Chair: Dianhua Wu

8:30-9:15

Routing on graphs

Guochuan Zhang, Zhejiang University

9:15-10:00

Analytic properties of combinatorial sequences

Bao-Xuan Zhu, Jiangsu Normal University

 Break

10:00-10:20


Invited  talks

Chair: Yongtang Shi

10:20-10:50

(2P2,K4)-free graphs are 4-colorable

Shenwei Huang, Nankai University

10:50-11:20

Some results and problems on unique-maximum colorings of plane graphs

Riste Škrekovski, University of Ljubljana and FIS

11:20-11:50

Trees with minimal atom-bond connectivity index-recent theoretical and computational results

Darko Dimitro, Faculty of Information Studies in Novo mesto

Lunch

12:00-13:30

Room Shuiyunjian

Session  1 (14:00-18:00) Meeting   Room 7 (-1st Floor)

Invited  talks

Chair: Mei Lu

14:00-14:30

More on Erdős–Gallai theorems on paths and cycles

Bo Ning, Tianjin University

14:30-15:00

Strongly-connected orientations and flow indices

Jiaao Li, Nankai University

15:00-15:30

Some results on matching covered graphs

Fuliang Lu, Minnan Normal University

Contributed  talks

Chair: Yan Liu

15:30-15:45

On s-hamiltonian connected line graphs

Taoye Zhang, Penn State Scranton

15:45-16:00

Relating the 2-domination number and the annihilation number of cactus graphs

Jun Yuer, Shandong Normal University

Break

16:00-16:15


Contributed  talks

Chair: Liming Xiong

16:15-16:30

Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n

Shengxiang Lv, Hunan Univ. of Scienc & Technology

16:30-16:45

Maximal resonance of {(3,4),4}-spheres

Rui Yang, Henan Polytechnic University

16:45-17:00

Sharp upper bounds on the k-independence number in regular graphs

Zhenyu Taoqiu, Nankai University

17:00-17:15

The saturation number of K3,3

Junxue Zhang, Nankai University

17:15-17:30

Hybrid fault diagnosis capability analysis of triangle-free graphs

Shunzhe Zhang, Hubei University

17:30-17:45

The bipancyclicity of bipartite hypercube-like networks

Ruichao Niu, Beijing Normal University

17:45-18:00

The non-inclusive diagnosability of hypercubes under the MM* model

Tongtong Ding, Beijing Normal University

Session 2 (14:00-18:15) Meeting Room 8   (-1st Floor)

Invited talks

Chair: Jianliang Wu

14:00-14:30

Classic bounds on eigenvalues and distance eigenvalues of graphs

Huiqiu Lin, East China Univ. of Science & Technology

14:30-15:00

The generalized distance matrix

Guixian Tian, Zhejiang Normal University

15:00-15:30

Quantum state transfer in graph operations

Xiaogang Liu, Northwestern   Polytechnical University

Contributed talks

Chair: Xiumei Wang

15:30-15:45

On graphs whose spectral radius does not exceed the hoffman limit value

Jianfeng Wang, Shandong University of Technology

15:45-16:00

A linear-time algorithm for clique-coloring planar graphs

Zuosong Liang, Qufu Normal University

Break

16:00-16:15


Contributed talks

Chair: Kefeng Diao

16:15-16:30

Combinatorial identities with generalized higher-order Genocchi sequences

Tian Hao, Inner Mongolia University

16:30-16:45

A note on degenerate type 2 Changhee polynomials and numbers

Sarengaowa Chen, Inner Mongolia University

16:45-17:00

Cache of MDS code combination trellis

Yiqun Li, Guangxi Normal University

17:00-17:15

Edge-colored complete graphs containing no properly colored odd cycles

Tingting Han, Northwestern Polytechnical   University

17:15-17:30

Total Coloring of some special graphs

Hui Zhang, Northwest Normal University

17:30-17:45

General-total coloring of K2,n,p (2≤n≤4, n≤p)

Shuang Zhang, Northwest Normal University

17:45-18:00

Vertex Strongly Distinguishing Total Coloring of Complete Bipartite Graphs K10,n

Liya Bao, Northwest Normal University

18:00-18:15

Spanning trees with at most 4 leaves in K1,5-free graphs

Panpan Wang, Qufu Normal University

Session 314:00-18:15Meeting Room 9 (-1st Floor)

Invited  talks

Chair: Zhizheng Zhang

14:00-14:30

Some results on generalized strong external difference families

Haitao Ca, Nanjing Normal University

14:30-15:00

The spectrum of semi-cyclic holey group divisible designs with block size three

Lidong Wang, China People’s Police University

Contributed  talks

Chair: Xian’an Jin

15:00-15:15

Asymptotic normality criteria of coefficients of a polynomial and their applications in combinatorics

Zhibin Du, Zhaoqing University

15:15-15:30

Equivariant Kazhdan-Lusztig polynomials of hagomizer matroid

Hongye Xie, Tianjin University of Technology

15:30-15:45

Equiangular lines and the Lemmens-Seidel conjecture

Mengyue Cao, Beijing Normal University

15:45-16:00

Multivariate stable Eulerian polynomials on egmented permutations

Xutong Zhang, Tianjin Normal University

Break

16:00-16:15


Contributed talks

Chair: Guanghui Wang

16:15-16:30

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs

Dingjun Lou, Sun Yat-sen University

16:30-16:45

Single-candidate voting for eliminating the least popular one

Chenhao Wang, AMSS, Chinese Academy of Science, City University of Hong Kong

16:45-17:00

General rumor blocking: an efficient random lgorithm with martingale approach

Qingqin Nong, Ocean University of China

17:00-17:15

Graph matching based on reinforcement learning

Siqi Tang, University of Chinese Academy of Sciences

17:15-17:30

Price of anarchy under uncertainty in load balancing games

Xiaoying Wu, Academy of Mathematics and Systems Science, Chinese Academy of Science

17:30-17:45

Sequential location game in continuous directional markets

Mengqi Zhang, Academy of Mathematics and Systems Science, Chinese Academy of Science

17:45-18:00

Integer linear programming formulations for double roman domination problem

Shunyu Yao, Nankai University

18:00-18:15

Detecting community structure in complex networks via resistance distance

Teng Zhang, Harbin Engineering University

Dinner

18:30-20:30

Junlan Hall (1st Floor)



返回原图
/