Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order

被引：7
|
作者：
Egawa, Yoshimi [1 ]
Furuya, Michitaka [1 ]
机构：
[1] Tokyo Univ Sci, Dept Math Informat Sci, Shinjuku Ku, Tokyo 1628601, Japan
来源：
GRAPHS AND COMBINATORICS | 2014年 / 30卷 / 05期
关键词：
Forbidden subgraph; Forbidden triple; 3-Connected graph;
D O I：
10.1007/s00373-013-1334-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a graph G and a set of connected graphs, G is said be -free if G does not contain any member of as an induced subgraph. We let denote the set of all 3-connected -free graphs. This paper is concerned with sets of connected graphs such that contains no star, and is finite. Among other results, we show that for a connected graph T( not equal K (1)) which is not a star, is finite if and only if T is a path of order at most 6.
引用
收藏
页码：1149 / 1162
页数：14
相关论文
共 50 条
12345