scientific article

zbMATH Open0629.05035MaRDI QIDQ3765800

Nikolaĭ G. Khadzhiivanov, Nedyalko Nenov

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

complete graphsminimal number of monochromatic trianglestwo-colorings

Mathematics Subject Classification ID

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

Related Items (1)

Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

This page was built for publication:

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