| Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2010: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
|---|
| Research Abstract |
For a set of connected graphs F, a graph G is said to be F-free if G does not contain any member of F as an induced subgraph.The set F is often referred as forbidden subgraphs. In the research, we have studied the property of the forbidden subgraphs F such that the set of k-connected F-free graphs is a finite set. We have given acomplete characterization of F in the cases of |F|≦2 and k≦6 and of |F|=3 and k≦2.We have also obtained a partial characterization in the case of |F|=3 and k=3.
|
