Bipartite graph (Tasks from MO category P, part 43)

Authors

  • Pavel Töpfer Faculty of Mathematics and Physics, Charles University, Prague

Abstract

In continuation of a series of articles on competition tasks in the Mathematical Olympiads of category P (programming), we will show how the procedures used to solve various tasks are repeated from time to time. The authors of the problems have at their disposal only a limited number of standard algorithms, the knowledge of which they can expect from the solvers. We will show two competition tasks from the older years of the olympiad, which look different at first glance and each concern a completely different topic. However, their solution is in principle exactly the same - in both cases. We will find out if the complement of the specified graph is bipartite.

Published

2022-02-28

How to Cite

Töpfer, P. (2022). Bipartite graph (Tasks from MO category P, part 43). MATHEMATICS–PHYSICS–INFORMATICS, 31(01), 58–65. Retrieved from https://mfi.upol.cz/index.php/mfi/article/view/581

Issue

Section

Informatics