離散數學›Ch6 圖論
第 30 題/共 34 題
◀ LS 30/34
30. Degree Sequence、Havel-Hakimi
#LS-06-030易Degree SequenceHavel-Hakimi

A sequence d1,d2,…,dnd_1, d_2, \ldots, d_n is called graphic if it is the degree sequence of a simple graph. Which of these sequences are graphic?

📄 中央113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 離散數學》Ch6 圖論
本章題號 · 21–34 / 34