更改

The bipartite realization problem is the problem of finding a simple bipartite graph with the degree sequence being two given lists of natural numbers. (Trailing zeros may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the digraph.)

The bipartite realization problem is the problem of finding a simple bipartite graph with the degree sequence being two given lists of natural numbers. (Trailing zeros may be ignored since they are trivially realized by adding an appropriate number of isolated vertices to the digraph.)

'''<font color="#ff8000"> 二分实现问题Bipartite realization problem</font>'''是通过已知的两组自然数序列作为度数序列，来查找简单的二分图的判定问题（数理逻辑）。（尾随零可以忽略，因为通过向图添加适当数量的孤立顶点可以轻松实现尾随零。）

'''<font color="#ff8000"> 二分实现问题Bipartite realization problem</font>'''是通过以已知的两组自然数序列作为度数序列，来查找简单的二分图的判定问题（数理逻辑）。（尾随零可以忽略，因为通过向图添加适当数量的孤立顶点可以实现尾随为零。）

   --[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）注意全文是否大写专业名词的首字母  已修改

   --[[用户:趣木木|趣木木]]（[[用户讨论:趣木木|讨论]]）注意全文是否大写专业名词的首字母  已修改