Tentative Schedule (Updated: 26 September)

October 15, Monday

800 900 Registration (Escaler Hall, SEC Building)
900 930

Opening Ceremonies

930 1020 Plenary Session: A. Schwenk
Nine Unexpected Applications of Linear Algebra in Graph Theory
1020 1030 Group Picture Taking
1030 1100 Break
1100 1150 Plenary Session: K.M. Koh
On Optimal Orientations of Graphs
1150 130

Lunch

  Parallel Sessions
  Group A Group B
130 150 Strongly Hamiltonian Decompositions of Complete Graphs
C. Nara*, G. Nakamura, N. Muto
Number of Unit Distances among Points in the Plane
N. Dean* , B. Servatius
155 215 On Non-Cayley Tetravalent Metacirculant Graphs
N.D. Tan
Certain Balanced Partitions of Two Sets of Points in the Plane and Path-Covering Problems
M. Kano* , A. Kaneko
220 240 Which Bipartite Graphs are Generalized Fibonacci Graphs?
W. Kawuwung* , E.L. Tan
A Pair in a Crowd of Unit Balls
H. Maehara*, K. Hosono, K Matsuda .
240 300 Break
300 320 Long Vertex-Disjoint Cycles in Graphs
Y. Egawa
On a Generalization of Ramsey Number for all Trees versus W4 or W5
E. Baskoro*, S.M. Surahmat, M. Miller
325 345 On Panconnected and Pancyclic K_{1,3}-Free Graphs
R. Ramos
Folding Wheels and Fans
R. Guerrero*, S. Gervacio, H. Rara
350 410 Two-factors with Cycles through Specified Vertices
T. Sakai
On the Subdivision Numbers of Wheels, Fans and Helms
R. Isla* , S. Gervacio
415 435 On 2-amalgamation of Paths and Cycles
T. Montero-Galliguez
Multilayered Cyclic Fence Graphs and their Novel Isomorphic Property
H. Hosoya*, J. Xia


October 16, Tuesday

900 950

Plenary Session: C. Praeger
Decomposing Graphs Very Nicely

950 1010 Break
  Parallel Sessions
  Group A Group B
1015 1035 A Proof to the NP-Completeness of the Dominating Sets Problem for Regular Bipartite Graphs
P. Fernandez
Three Equivalent Partial Orders on Graphs with Real Edge-Thickness: on Lengths, Cuts, and Operations
H. Ito
1040 1100 On the Complexity of the Dominating Set Problem for Degree-Bounded Planar Graphs
J.P. Vergara
On the Generalized n-Cube
P. Tripathi*, J. Caro
1105 1125 A Note on the Calculating Power Indices for Edge Failure Spanning Tree Games
Y. Matsui
A Neighborhood Condition for Graphs to have [a,b]-Factors II
H. Matsuda
1130 1150 An Application of  the Conti-Traverso Algorithm to  the Traveling Salesman Problem
M. Ito* , R. Hirabayashi
Convexity Number under some Graph Operations
S. Canoy*, I.J.L. Garces
1150 130 Lunch
130 220 Plenary Session: J. Urrutia
On the Combinatorics of Point Sets
225 245 Convex Subset containing One Simplex in the Plane
K. Hosono
On Graphs that are Isomorphic to their Clique Graphs
G.L. Chia
250 310 Measuring the Point Asymmetry of Convex Polygons
Y. Maeda
Degree Sequence and the Clique Number of Graphs
N. Punnim
315 335 On the Number of Disjoint Convex Polygons for a Planar Point Set
M. Urabe* , K. Hosono
Some Combinatorial Properties of k-nary n-cube via an Algorithm
E. Adina*, E. Tan
335 355 Break
355 445 Special Lecture: J. Akiyama
Reversible Solids
(to be followed by an exhibit)


October 17, Wednesday

900 950

Plenary Session: J. Pach
Variations on the Theme of Distinct Distances

950 1010 Break
  Parallel Sessions
  Group A Group B
1015 1035 Application of  Graph Theory to Cluster Computing
F. Muga
On Graphs All of Whose Orientations are Singular
E. Agpalza*, S. Gervacio, H. Rara
1040 1100 Embedding Tori onto Stack-Graphs
T. Kodate* ,  J. Yu
Singularity and Nonsingularity of the Composition and Conjunction of Cycles and Circuits
I. Jos*, S. Gervacio
1105 1125 Embedding the Hypercube in the Generalized de Bruijn Graph
R. Regmi* , J. Caro
Graphs G for which both G and \overline{G} are k-contraction Critical
K. Ando*, J. Akiyama
1130 1150 Isomorphism of the Generalized Pancake Graph MPn and the Cayley Graph on the Wreath Product of Z'm  by Sn
M. Justan* , F. Muga
Some Problems of Orientations of Complete Multipartite Graphs
V. Petrovic*, M. Treml, G. Woeginger
1150 130 Lunch
130 150 Resolvable Coverings of 2-path by Cycles
M. Kobayashi, G. Nakamura*
Parallel Graph Coloring Heuristics for Optimizing Course Timetables
A. Calaor*,  A. Hermosilla
155 215 On the Span and Extent of Unit-Distance Graphs in the Plane
S. Gervacio*, H. Maehara , J. Uy
A Minimal Broadcast Graph in Recursive Circulants
F. Muga, W. Tabares* , R. Gardon
220 240 Extending the Planar Grid to a Minimal 3-Rigid Unit Distance Graph
G. Rosalejos*, S. Gervacio ,  J. Uy
Winning Strategies for Various Nim-Like Games
T. Ooya , J. Akiyama*
240 300 Break
300 350 Plenary Session: F. Harary
Conditional Graph Theory