We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
生成讲解博客的中文版本
生成AI智能校验的中文版本