加载中…
Let be an directed graph on vertices with minimum degree at least and minimum semi-degree at least . We present a detailed proof of the following result [13]: The digraph is pancyclic, unless some extremal cases (which are characterized).

生成讲解博客的中文版本

生成AI智能校验的中文版本