| | Mikio Kano
Ibaraki University
Japan
September 15 & 18, 2010
First talk:
Spanning Trees of Graphs (Wednesday, September 15) |
ABSTRACT: Some results and problems on spanning trees of graphs
will be presented.
In particular, we deal with spanning $k$-trees,
spanning $k$-ended trees, $k$-leaf connected graphs and
others.
Second talk:
Discrete Mathematics with Colored Objects (Saturday, September 18)
ABSTRACT: In a graph coloring, for a given graph,
we try to color its vertices or edges so that the
resulting colored graph has some given properties.
In this talk, we consider the following type of problems.
A colored graph with some property is given, then
we want to find a some special subgraph (monochromatic, heterochromatic or other
kind of subgraph) in it. We consider similar problems on discrete geometry
and other discrete mathematics. I think that this type of area
will be a big research area in a future.
|
Information |
| Time and Date: |
Wednesday, September 15, 2010 - 14:00-15:00
Saturday, September 18, 11:00-12:00
| |
| Place: Lecture Hall, Niavaran Bldg., Niavaran Sqr., Tehran, Iran |
| |
