Tuesday, January 13 Place: Info-Libary Buliding

08:30~09:00 Registration

Session 1.    Chairman: Sandi Klavzar (University of Ljubljana)

09:00~10:00 Plenary Speaker: Claude Tardif (Royal Military College)

                   Title: A chromatic dilemma

10:00~10:30 Tea Break

Session 2.    Chairman: Sen-Peng Eu (National University of Kaohsiung)

10:30~11:15 Invited Speaker: Beifang Chen (The Hongkong University of Science and Technology)

                   Title: The flow and tension lattices of signed graphs

11:15~12:00 Invited Speaker: Leizhen Cai (The Chinese University of Hongkong)

                   Title: FPT Algorithms for Finding Even/Odd Subgraphs

12:10~13:30 Lunch

Session 3.    Chairman: Arnaud Pecher (University of Bordeaux I)

13:30~14:15 Invited Speaker: Serguei Norine (Princeton University)

                   Title: Kt minors in large t-connected graphs

14:15~15:00 Invited Speaker: Li-Da Tong (National Sun Yat-Sen University)

                   Title: The hamiltonian numbers of double-loop networks

15:00~15:30 Tea Break

Session 4.    Chairman: Beifang Chen (The Hongkong University of Science and Technology)

15:30~15:55 Contributed Speaker: Mickael Montassier (University of Bordeaux I)

                   Title: The 3-Color Problem

15:55~16:20 Contributed Speaker: Xuding Zhu (National Sun Yat-sen University)

                   Title: Total weighting of graphs by max-min method

16:20~16:45 Contributed Speaker : Tsai-Lien Wong (National Sun Yat-sen University)

                   Title: Total weighting of graphs by combinatorial nullstellensatz

18:00~          Dinner