On minimally 3-connected graphs on a surface

研究成果: Article査読

抄録

It is well known that the maximal size of minimally 3-connected graphs of order n ≥ 7 is 3n-9. In this paper, we shall prove that if G is a minimally 3-connected graph of order n, and is embedded in a closed surface with Euler characteristic χ, then G contains at most 2n- min {2, 2χ} edges. This bound is best possible for every closed surface.

本文言語English
ページ数1
ジャーナルElectronic Notes in Discrete Mathematics
11
DOI
出版ステータスPublished - 2002 7 1
外部発表はい

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

フィンガープリント 「On minimally 3-connected graphs on a surface」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル