Program
Middle Tennessee State University, May 24-May 26, 2013
Opening speech: Bud Fisher (1:00-1:15 pm) (ROOM 160)
ROOM 160
- 1:20-1:45 Mike Plummer
A Problem on Well-Covered Graphs - 1:45-2:10 Stan Dziobiak
Large W k- or K 3,t-minors in 3-connected Graphs - 2:10-2:35 John Maharry
A Proof of Robertson's Characterization of V8-free Graphs
ROOM 164
- 1:20-1:45 Rupei Xu
Discovering Efficient Sets of Key Players in Directed Weighted Social Networks - 1:45-2:10 Inna Vasylieva
Very Cost Effecitve bipartitions in Graphs - 2:10-2:35 Stephen Hedetniemi
Towards a Theory of Graph Bipartitions
2:35-3:00 Coffee Break
3:00-3:50: Plenary Speaker: Agelos Georgakopoulos (ROOM 160)
Random walks on graphs: a survey
ROOM 160
- 4:00-4:25 Amy Yates
Intersection of Longest Paths in Connected K 4-minor-free Graphs - 4:25-4:50 Michael Santana
Forbidden Subgraphs for Pancyclicity - 4:50-5:15 Songling Shan
Disjoint chorded cycles of the same length - 5:15-5:35 Terry McKee
Pairs of Edges as Chords and as Cut-Edges
ROOM 164
- 4:00-4:25 Robert Beeler
Peg Solitaire on Graphs: Current Results and Open Problems - 4:25-4:50 Aaron Gray
The Extremal Problem in Peg Solitaire on Graphs - 4:50-5:15 Casey Moffatt
Locating a Robber on a Tree - 5:15-5:35 Kerry Ojakian
Cops and Robber on the Hypercube
May 25 2013
ROOM 160
- 8:30-8:55 Rao Li
The Spectral lower bounds for the circumferences of graphs - 8:55-9:20 Timothy Morris
On 2-factors with a bounded number of odd components
ROOM 164
- 8:30-8:55 Peter Slater
Recurrence templates for series-parallel graphs - 8:55-9:20 Vaidyanathan Sivaraman
Gammoids and bias matroids
9:30-10:20 Plenary Speaker: Cun-Quan Zhang (Room 160)
Contractible Configurations for Flows
10:20-10:45 Coffee Break
ROOM 160
- 10:45-11:10 Yezhou Wu
Nowhere-zero 3-flows of Signed Graphs - 11:10-11:35 Senmei Yao
Group Connectivity of Line Graphs - 11:35-12:00 Julian Allagan
Tutte Polynomials of Some Graphs and Multigraphs
ROOM 164
- 10:45-11:10 James Reid
3-connected Binary and Regular Matroids without Certain Minors - 11:10-11:35 Bette Catherine Putnam
Bicircular Matroids with Circuits of Few Sizes - 11:35-12:00 Jesse Taylor
On Matroids in Which All the Circuits are Big
12:00-1:30 Lunch Break
ROOM 160
- 1:30-1:55 Blair D. Sullivan
Identifying and Extracting Tree-like Structure in Complex Networks - 1:55-2:20 Teresa Haynes
No Bull! - 2:20-2:45 Michael Ferrara
New Results on Some Colored Saturation Problems
ROOM 164
- 1:30-1:55 Catherine Erbes
Edge exchanges in k-uniform Hypergraphs - 1:55-2:20 Jie Han
Exact minimum d-degree thresholds for Hamiltonian cycles in k-uniform Hypergraphs - 2:20-2:45 Travis Johnston
Lagrangians and Jumps of Non-uniform Hypergraphs
2:50-3:40 Plenary Speaker: Neil Robertson (ROOM 160)
Well-Quasi order of graph minors and Topological ideas
3:40-4:05 Coffee Break
ROOM 160
- 4:05-4:30 Johannes Hattingh
The Irredundant Ramsey Number S (3,8) - 4:30-4:55 Ben Stucky
An Algorithmic Approach to Raising the Lower Bound of R (5,5) - 4:55-5:20 Honghai Xu
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs - 5:20-5:45 Ann Clifton
The Lower Bound on the Packing Chromatic Number of Regular Graphs - 5:45-6:10 Thomas Mahoney
Online Scheduling and Paintability
ROOM 164
- 4:05-4:30 Jinko Kanno
Genus and other graph invariants - 4:30-4:55 Duane Skaggs
On graphs with Equal Domination and Identification Numbers - 4:55-5:20 Jacob Wildstrom
Domination Bounds in Products of Mycielskians - 5:20-5:45 Mari Castle
Tottal Efficient Dominating Sets in Cayley Graphs of Finite Abelian Groups - 5:45-6:10 Miranda Bowie
Ratios of Set-Sized Domination Parameters
May 26 2013
8:30-9:20 Plenary Speaker: Paul Balister
Controllability, Matchings, and the Karp-Sipser Algorithm on Random Graphs
ROOM 160
- 9:30-9:55 Russ Woodroofe
On inclusion-exclusion in subgroup and coset lattice - 9:55-10:20 Soumya Bhoumik
Classification of Vertex-Transitive Graphs of Order a Prime Cubed II
ROOM 164
- 9:30-9:55 Mark Shattuck
On a Cubic Geometric Inequality - 9:55-10:20 Shilpa Dasgupta
Characterization of 2-path unit probe interval graphs
10:20-10:45 Coffee Break
ROOM 160
- 10:45-11:10 Heping Zhang
3-Factor-Criticality of Vertex-Transtive Graphs - 11:10-11:35 Suil O
Matchings and eigenvalues in regular graphs or multigraphs - 11:35-12:00 Xiaofeng Gu
Laplacian eigenvalues and Forest Covering of Graphs
ROOM 164
- 10:45-11:10 Peter Johnson
Huffman vs. Recency Rank Coding for Zeroth Order Sources - 11:10-11:35 Ted Dobson
Monomial Isomorphisms of Cyclic Codes - 11:35-12:00 James Jerkins
An Algorithm for the Non-Existance of a Synchronizing Sequence on a Directable Deterministic Finite Automation
Add right column content here
