最終更新日：2022/12/23
We show that a graph is cpsd if and only if it has no odd cycle of length at least 5 as a subgraph.
編集履歴（0）
We show that a graph is cpsd if and only if it has no odd cycle of length at least 5 as a subgraph.
DiQt（ディクト）
無料
★★★★★★★★★★
