Even edge colorings of a graph |
| |
| Authors: | Noga Alon Yoshimi Egawa |
| |
| Affiliation: | Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA;Department of Applied Mathematics, Science University of Tokyo, Shinjuku-ku, Tokyo, 162 Japan |
| |
| Abstract: | It is shown that the minimum number of colors needed to paint the edges of a graph G so that in every cycle of G there is a nonzero even number of edges of at least one color is ?log2χ(G)?. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
