Even edge colorings of a graph

Noga Alon, Yoshimi Egawa

Research output: Contribution to journalArticle

1 Citation (Scopus)


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 ⌈log(G)⌉.

Original languageEnglish
Pages (from-to)93-94
Number of pages2
JournalJournal of Combinatorial Theory, Series B
Issue number1
Publication statusPublished - 1 Jan 1985


Cite this