最終更新日：2024/07/29
The edge covering number of a graph is the minimum number of edges that need to be selected such that every vertex of the graph is incident to at least one selected edge.
正解を見る
The edge covering number of a graph is the minimum number of edges that need to be selected such that every vertex of the graph is incident to at least one selected edge.
編集履歴（0）
