| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2010: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2009: ¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
|
|---|
| Research Abstract |
Brualdi et al. conjectured that a properly edge-colored complete graph of order 2n(>5)with 2n-1 colors can be decomposed into n edge-disjoint heterochromatic spanning trees. We generalized this conjecture by defining an f-chromatic graph, by which we can study stepwise the conjecture. In particular, we proved the generalized conjecture with f(c)=n-2. Moreover, we proved a necessary and sufficient condition for existence of an f-chromatic spanning forest with exactly w components, and generalized two previous results by applying the condition.
|
