| Budget Amount *help |
¥10,660,000 (Direct Cost: ¥8,200,000、Indirect Cost: ¥2,460,000)
Fiscal Year 2012: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2011: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2010: ¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
Fiscal Year 2009: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
|
|---|
| Research Abstract |
In this research, we have worked on graph coloring problem for
1. graphs on a surface, and 2. minor-closed family of graphs.
Concerning the first one, we give several algorithmic results. Namely. we give a polynomial time algorithm for deciding 5-list-colorability of graphs on a fixed surface, and for deciding 3-list-colorablity of graphs of girth five on a fixed surface. Concerning the second one, we show that minimal-counterexample to the famous Hadwiger's conjecture is 0.2k-connected for the case k. This is the first step toward a chacterization of such a minimal-counterexample.
|
