Coloring a graph optimally with two colors

DOI10.1016/0012-365X(93)90050-4MaRDI QIDQ685594zbMATH OpenOpenAlexFDO

Authors 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

coloringgraph two-coloringmonochromatic edgesupper and lower bounds

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs have two-coloring number at most 8
• Coloring Graphs with Minimal Edge Load
• Note on graphs colouring
• scientific article; zbMATH DE number 4023316
• \(\mathrm{M}_2\)-edge colorings of dense graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On some extremal problems in graph theory
• Parallel concepts in graph theory

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

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