75
个编辑
更改
跳到导航
跳到搜索
第70行：
第70行： − +
无编辑摘要
The question of whether a given degree sequence can be realized by a simple graph is more challenging. This problem is also called graph realization problem and can either be solved by the Erdős–Gallai theorem or the Havel–Hakimi algorithm.
The question of whether a given degree sequence can be realized by a simple graph is more challenging. This problem is also called graph realization problem and can either be solved by the Erdős–Gallai theorem or the Havel–Hakimi algorithm.
一个给定的度序列是否可以用一个简单的图进行表示，是一个具有挑战性的问题。这个问题也称为'''<font color="#ff8000">图实现 Graph Realization Problem</font>'''问题，可以用 Erdős–Gallai定理解决，也可以用Havel-Hakimi算法解决。
一个给定的度序列是否可以用一个简单的图进行表示，是一个具有挑战性的问题。这个问题也称为'''<font color="#ff8000">图实现 Graph Realization Problem</font>'''问题，可以用'''<font color="#ff8000">Erdős–Gallai定理 Erdős–Gallai Theoreme</font>'''解决，也可以用'''<font color="#ff8000">Havel-Hakimi算法 Havel–Hakimi Algorithm</font>'''解决。
The problem of finding or estimating the number of graphs with a given degree sequence is a problem from the field of [[graph enumeration]].
The problem of finding or estimating the number of graphs with a given degree sequence is a problem from the field of [[graph enumeration]].