Even edge colorings of a graph

DOI10.1016/0095-8956(85)90094-2zbMATH Open0556.05026OpenAlexW1964571783MaRDI QIDQ5895486FDOQ5895486

Authors: Noga Alon, Yoshimi Egawa 

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90094-2

Recommendations

• The chromatic index of graphs of even order with many edges
• Monochromatic even cycles
• scientific article; zbMATH DE number 4070929
• Parity and strong parity edge-colorings of graphs
• Cycle lengths and chromatic number of graphs

zbMATH Keywords

edge coloringvertex chromatic numberfinite undirected simple graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Even edge colorings of a graph

Cited In (4)

• Decomposing hypergraphs into \(k\)-colorable hypergraphs
• Title not available (Why is that?)
• Local \(k\)-colorings of graphs and hypergraphs
• Bounds for chromatic number in terms of even-girth and booksize

This page was built for publication: Even edge colorings of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895486)