Forbidden Triples Involving the Complete Bipartite Graph with Partite Sets Having Cardinalities Two and Three

被引：0
|
作者：
Egawa, Yoshimi [1 ]
Zhao, Zhixian [1 ]
机构：
[1] Tokyo Univ Sci, Dept Appl Math, Shinjuku Ku, 1-3 Kagurazaka, Tokyo 1628601, Japan
来源：
ARS COMBINATORIA | 2021年 / 154卷
关键词：
Forbidden subgraph; Forbidden triple; 3-connected graph; SUBGRAPHS;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G(3)(F) denote the set of all 3-connected F-free graphs. This paper is concerned with trees T such that G(3)({K-3, K-2,K-3, T}) is finite. Among other results, we show that G(3)({K-3, K-2,K-3, P-9}) is finite.
引用
收藏
页码：159 / 195
页数：37
相关论文
共 12 条
12