| Budget Amount *help |
¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2015: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2014: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2013: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
|---|
| Outline of Final Research Achievements |
A subgraph whose edges have distinct colors is called a heterochromatic subgraph. We define a (g,f)-chromatic subgraph as a subgraph having at least g(c) and at most f(c) edges colored with c for any color c, where g and f are functions from a color set to the set of non-negative integers. In this research, we studied conditions for existence of a (g,f)-chromatic subgraph in edge-colored graphs, and we got the following results.
(1) We got a necessary and sufficient condition for existence of a (g,f)-chromatic subgraph in edge-colored graphs. (2) We studied heterochromatic subgraphs with some upper bound of maximum degree. (3) We generalized some previous results on heterochromatic subgraphs. (4) We got a sufficient condition for existence of a spanning k-tree in bipartite graphs. (5) We got a Lemma for balanced partition of a sequence of colored elements.
|
