Generalizations of the Greene-Kleitman theorem
Discrete Mathematics（1994）
摘要
rability graph though the statement of thetheorem holds. On the other hand, the graph G given byV = fa; b; c; d; e; fg ; E = fab; bc; ac; ad; be; cfgis perfect but the x i do not even form a partition.A general survey of the area was given in [9]. For generalizations to acyclic directedgraphs, see [1] and the references therein.References
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要