On subgraphs of Cartesian product graphs

被引：10
|
作者：
Klavzar, S
Lipovec, A
Petkovsek, M
机构：
[1] Univ Maribor, Dept Math, PEF, SLO-2000 Maribor, Slovenia
[2] Univ Ljubljana, Dept Math, Ljubljana 1111, Slovenia
来源：
DISCRETE MATHEMATICS | 2002年 / 244卷 / 1-3期
关键词：
graph products; Cartesian product; S-prime graph; path coloring;
D O I：
10.1016/S0012-365X(01)00085-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K-2.3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：223 / 230
页数：8
相关论文
共 50 条
12345