2012 Fiscal Year Final Research Report
Forbidden subgraphs generating a finite set
| Project/Area Number |
22500018
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Nihon University |
|---|
Principal Investigator |
SAITO Akira 日本大学, 文理学部, 教授 (90186924)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Keywords | グラフ理論 / 禁止部分グラフ / 誘導部分グラフ / 有限集合 / 連結度 |
|---|
| 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.
|
