On minimally 3-connected graphs on a surface

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)760
Number of pages1
JournalElectronic Notes in Discrete Mathematics
Volume11
DOIs
Publication statusPublished - 2002 Jul
Externally publishedYes

Fingerprint

Connected graph
Closed
Euler Characteristic

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

On minimally 3-connected graphs on a surface. / Ota, Katsuhiro.

In: Electronic Notes in Discrete Mathematics, Vol. 11, 07.2002, p. 760.

Research output: Contribution to journalArticle

@article{abc9f1d7c91546fa8fffc9ba92f01a1f,
title = "On minimally 3-connected graphs on a surface",
abstract = "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.",
author = "Katsuhiro Ota",
year = "2002",
month = "7",
doi = "10.1016/S1571-0653(05)80006-X",
language = "English",
volume = "11",
pages = "760",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

TY - JOUR

T1 - On minimally 3-connected graphs on a surface

AU - Ota, Katsuhiro

PY - 2002/7

Y1 - 2002/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34247107687&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247107687&partnerID=8YFLogxK

U2 - 10.1016/S1571-0653(05)80006-X

DO - 10.1016/S1571-0653(05)80006-X

M3 - Article

AN - SCOPUS:34247107687

VL - 11

SP - 760

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -