Wednesday, July 15

CP12
Perfect Graphs and Intersection Families

10:30 AM-12:30 PM
Chair: Elaine M. Eschen, Fisk University
Room: Sidney Smith 2125

10:30 The Relationship Between Weakly Triangulated Comparability Graphs and Chordal Bipartite Graphs

Elaine M. Eschen, Fisk University; Ryan B. Hayward, University of Lethbridge, Canada; Jeremy Spinrad, Vanderbilt University; and R. Sritharan, Indiana State University

10:50 Strong Clique Trees and Strongly Chordal Graphs

Terry McKee, Wright State University

11:10 Hamiltonian Cycle Powers in Threshold Graphs

Garth Isaak, Lehigh University

11:30 P₄--Free Colourings and P₄--Bipartite Graphs

Chinh T. Hoang, Lakehead University, Thunder Bay, Canada; and Van Bang Le, Universität Rostock, Germany

11:50 On (X,2X)-Type Generators for the Family of Line Graphs

Leizhen Cai, The Chinese University of Hong Kong, Hong Kong, China

12:10 Graph Pebbling, Threshold Functions, and the LYM Inequality

Glenn H. Hurlbert, Arizona State University; and Nancy Eaton, University of Rhode Island

12:30 Split and Retract Bandwidths of a Graph

Fedor V. Fomin, St.Petersburg State University, Russia

12:30 Graph Theory Based on an Idea of Perfect Combinatorial Configuration

V. Riznyk, Lviv Polytechnic State University, Ukraine