Coloring a graph optimally with two colors

DOI10.1016/0012-365X(93)90050-4zbMath0784.05026OpenAlexW2053573383MaRDI QIDQ685594

Juan-Miguel Gracia

Publication date: 17 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90050-4

zbMATH Keywords

upper and lower boundscoloringmonochromatic edgesgraph two-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• On some extremal problems in graph theory

This page was built for publication: Coloring a graph optimally with two colors