Even edge colorings of a graph

Noga Alon, Yoshimi Egawa

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


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 (US)
Pages (from-to)93-94
Number of pages2
JournalJournal of Combinatorial Theory, Series B
Issue number1
StatePublished - Feb 1985
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Even edge colorings of a graph'. Together they form a unique fingerprint.

Cite this