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 条

[1] Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order
Yoshimi Egawa
Michitaka Furuya
Graphs and Combinatorics, 2014, 30 : 1149 - 1162
[2] Forbidden Triples Involving the Complete Bipartite Graph with Partite Sets Having Cardinalities Two and Three
Egawa, Yoshimi
Zhao, Zhixian
ARS COMBINATORIA, 2021, 154 : 159 - 195
[3] ON LINE GRAPH OF COMPLETE BIPARTITE GRAPH
HOFFMAN, AJ
ANNALS OF MATHEMATICAL STATISTICS, 1964, 35 (02): : 883 - &
[4] On Component Order Edge Connectivity Of a Complete Bipartite Graph
Gross, Daniel
Karmierczak, L. William
Saccoman, John T.
Suffel, Charles
Suhartomo, Antonius
ARS COMBINATORIA, 2013, 112 : 433 - 448
[5] Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph
Manikandan, R. S.
Paulraja, P.
ARS COMBINATORIA, 2006, 80 : 33 - 44
[6] ON THICKNESS OF COMPLETE BIPARTITE GRAPH
BEINEKE, LW
MOON, JW
HARARY, F
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1964, 60 (01): : 1 - &
[7] COARSENESS OF COMPLETE BIPARTITE GRAPH
BEINEKE, LW
GUY, RK
CANADIAN JOURNAL OF MATHEMATICS, 1969, 21 (05): : 1086 - &
[8] Multidesigns of complete graphs for graph-triples of order 6
Cusack, Charles A.
Edwards, Stephanie P.
Parker, Darren B.
Journal of Combinatorial Mathematics and Combinatorial Computing, 2015, 94 : 177 - 203
[9] Uniform coverings of 2-paths in the complete graph and the complete bipartite graph
1600, Charles Babbage Research Centre (99):
[10] Complete bipartite graph is a totally irregular total graph
Tilukay, Meilin, I
Taihuttu, Pranaya D. M.
Salman, A. N. M.
Rumlawang, Francis Y.
Leleury, Zeth A.
ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2021, 9 (02) : 387 - 395

← 1 2 3 4 5 →