BOUNDING THE NUMBER OF EMBEDDINGS OF 5-CONNECTED PROJECTIVE-PLANAR GRAPHS

被引：0

作者：

KITAKUBO, S

机构：

来源：

JOURNAL OF GRAPH THEORY | 1991年 / 15卷 / 02期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projective-planar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c(less-than-or-equal-to 120).

引用

页码：197 / 205

页数：9

共 50 条

[1] Re-embedding structures of 5-connected projective-planar graphs
Kitakubo, S
Negami, S
DISCRETE MATHEMATICS, 2002, 244 (1-3) : 211 - 221
[2] ENUMERATION OF PROJECTIVE-PLANAR EMBEDDINGS OF GRAPHS
NEGAMI, S
DISCRETE MATHEMATICS, 1986, 62 (03) : 299 - 306
[3] UNIQUE AND FAITHFUL EMBEDDINGS OF PROJECTIVE-PLANAR GRAPHS
NEGAMI, S
JOURNAL OF GRAPH THEORY, 1985, 9 (02) : 235 - 243
[4] 4-CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN
THOMAS, R
YU, XX
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 62 (01) : 114 - 132
[5] Internally 4-connected projective-planar graphs
Ding, Guoli
Iverson, Perry
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 108 : 123 - 138
[6] Flexibility of projective-planar embeddings
Maharry, John
Robertson, Neil
Sivaraman, Vaidy
Slilaty, Daniel
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 241 - 300
[7] 4-connected projective-planar graphs are hamiltonian-connected
Kawarabayashi, Ken-ichi
Ozeki, Kenta
PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 378 - 395
[8] 4-connected projective-planar graphs are Hamiltonian-connected
Kawarabayashi, Ken-ichi
Ozeki, Kenta
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 112 : 36 - 69
[9] THE PROJECTIVE-PLANAR SIGNED GRAPHS
ZASLAVSKY, T
DISCRETE MATHEMATICS, 1993, 113 (1-3) : 223 - 247
[10] Orientable embeddings and orientable cycle double covers of projective-planar graphs
Ellingham, M. N.
Zha, Xiaoya
EUROPEAN JOURNAL OF COMBINATORICS, 2011, 32 (04) : 495 - 509

← 1 2 3 4 5 →