Last Updated：2025/11/22
In this class of bipartite graphs, the covering number equals the size of a maximum matching by König's theorem.
See correct answer
In this class of bipartite graphs, the covering number equals the size of a maximum matching by König's theorem.
音声機能が動作しない場合はこちらをご確認ください
Edit Histories（0）
