On Cartesian products with small crossing numbers

被引：4

作者：

Klesc, Marian ^{[1
]}

Petrillova, Jana ^{[1
]}

机构：

[1] Tech Univ Kosice, Dept Math & Theoret Informat, Kosice, Slovakia

来源：

CARPATHIAN JOURNAL OF MATHEMATICS | 2012年 / 28卷 / 01期

关键词：

Cartesian product; crossing number; drawing; graph; LINE GRAPHS;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Kulli at al. started to characterize line graphs with crossing number one. In this paper, the similar problems were solved for the Cartesian products of two graphs. The necessary and sufficient conditions are given for all pairs of graphs G(1) and G(2) for which the crossing number of their Cartesian product G(1) x G(2) is one or two.

引用

页码：67 / 75

页数：9

共 13 条

[1]

Akka D.G., 1997, U BOEGRAD PUBL ELE M, V8, P3

[2]

[Anonymous], 1973, Nanta. Math.

[3] ON THE CROSSING NUMBERS OF PRODUCTS OF CYCLES AND GRAPHS OF ORDER 4 [J].

BEINEKE, LW ;

RINGEISEN, RD .

JOURNAL OF GRAPH THEORY, 1980, 4 (02) :145-155

[4]

Drazenská E, 2007, TATRA MT MATH PUBL, V36, P109

[5] The crossing number of Cm x Cn is as conjectured for n≥m(m+1) [J].

Glebsky, LY ;

Salazar, G .

JOURNAL OF GRAPH THEORY, 2004, 47 (01) :53-72

[6] On graphs whose line graphs have crossing number one [J].

Jendrol, S ;

Klesc, M .

JOURNAL OF GRAPH THEORY, 2001, 37 (03) :181-188

[7]

JENDROL S, 1982, CASOPIS PRO PESTOVAN, V107, P225

[8] THE CROSSING NUMBERS OF PRODUCTS OF PATHS AND STARS WITH 4-VERTEX GRAPHS [J].

KLESC, M .

JOURNAL OF GRAPH THEORY, 1994, 18 (06) :605-614

[9]

KLESC M, 1991, MATH SLOVACA, V41, P113

[10]

KLESC M, 1995, DISCUSS MATH GRAPH T, V15, P5

← 1 2 →