Even edge colorings of a graph

Noga Alon; Yoshimi Egawa

doi:10.1016/0095-8956(85)90094-2

Even edge colorings of a graph

Noga Alon
, Yoshimi Egawa

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

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

Original language	English (US)
Pages (from-to)	93-94
Number of pages	2
Journal	Journal of Combinatorial Theory, Series B
Volume	38
Issue number	1
DOIs	https://doi.org/10.1016/0095-8956(85)90094-2
State	Published - Feb 1985
Externally published	Yes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0095-8956(85)90094-2

Cite this

@article{983ec65f8a2f4c9997d8773758d70eaa,

title = "Even edge colorings of a graph",

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)⌉.",

author = "Noga Alon and Yoshimi Egawa",

year = "1985",

month = feb,

doi = "10.1016/0095-8956(85)90094-2",

language = "English (US)",

volume = "38",

pages = "93--94",

journal = "Journal of Combinatorial Theory, Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Even edge colorings of a graph

AU - Alon, Noga

AU - Egawa, Yoshimi

PY - 1985/2

Y1 - 1985/2

N2 - 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)⌉.

AB - 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)⌉.

UR - https://www.scopus.com/pages/publications/46549102194

UR - https://www.scopus.com/pages/publications/46549102194#tab=citedBy

U2 - 10.1016/0095-8956(85)90094-2

DO - 10.1016/0095-8956(85)90094-2

M3 - Article

AN - SCOPUS:46549102194

SN - 0095-8956

VL - 38

SP - 93

EP - 94

JO - Journal of Combinatorial Theory, Series B

JF - Journal of Combinatorial Theory, Series B

IS - 1

ER -

Even edge colorings of a graph

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this