On 3-colorings of \(E(K_ n)\)

DOI10.1016/0012-365X(93)90071-ZzbMath0783.05061OpenAlexW2051037924WikidataQ126982524 ScholiaQ126982524MaRDI QIDQ685557

Jeong Han Kim

Publication date: 18 January 1994

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

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

zbMATH Keywords

maximum matchingcomplete graphcolours

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On 3-colorings of \(E(K_ n)\)