16 引用 (Scopus)

抜粋

Caccetta and Häggkvist [1] conjectured that every digraph with n vertices and minimum outdegree k contains a directed cycle of length at most {plus 45 degree rule}n/k. With regard to this conjecture, Chvátal and Szemerédi [2] proved that if G is a digraph with n vertices and if each of these vertices has outdegree at least k, then G contains a cycle of length at most (n/k) + 2500. Our result is an improvement of this result.

元の言語English
ページ(範囲)295-298
ページ数4
ジャーナルDiscrete Mathematics
72
発行部数1-3
DOI
出版物ステータスPublished - 1988 12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

フィンガープリント Short cycles in digraphs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用