SBU Combinatorics Day, March 4, 2009, Shahid Beheshti University 
 

Registration

  8:00
  8:30

Story of the king and the mathematician several open problems

Mehdi
Behzad

  8:30
  9:15

Some colorful results for graphs without an even cycle

Manouchehr
Zaker

  9:15
  9:45

A generalization of uniquely colorable graphs

Rouzbeh
Tusserkani

  9:45
10:15

Break

10:15
10:45

On the total restrained domination number of graphs

Behnaz
Omoomi

10:45
11:00

On the spectral characterization of Hamming graphs

Behruz
Tayfeh-Rezaie

11:00
11:30

What do I mean by combinatorial thinking

Mani
Rezaie

11:30
11:50

On colorings of graph fractional powers

Moharram
N. Iradmusa

11:50
12:10

Lunch

12:10
14:00

Silver graphs

Ebadollah S. Mahmoodian

14:00
14:45

On some algorithmic aspects of the isoperimetry problem on graphs

Amir
Daneshgar

14:45
15:15

The interpretation of protein structures based on graph theory and contact map

Changiz
Eslahchi

15:15
15:45

Break

15:45
16:00

Graph Lab

Azin
Azadi

16:00
16:15

Codes with girth 8

Amin
Sakzad

16:15
16:35

Problem Session

16:35
17:30