Open Access
June 2002 Vertex-Disjoint Copies of K1+(K1K2) in Graphs
Shinya Fujita
Author Affiliations +
SUT J. Math. 38(2): 201-209 (June 2002). DOI: 10.55937/sut/1057898665


Let S denote the graph obtained from K4 by removing two edges which have an endvertex in common. Let k be an integer with k2. Let G be a graph with |V(G)|4k and σ2(G)|V(G)|/2+2k1, and suppose that G contains k vertex-disjoint triangles. In the case where |V(G)|=4k+2, suppose further that GK4t+3K4k4t1 for any t with 0tk1. Under these assumptions, we show that G contains k vertex-disjoint copies of S.


I would like to thank Professor Katsuhiro Ota and Dr.Ken-ichi Kawarabayashi for stimulating discussions concerning the problem discussed in this paper.


Download Citation

Shinya Fujita. "Vertex-Disjoint Copies of K1+(K1K2) in Graphs." SUT J. Math. 38 (2) 201 - 209, June 2002.


Received: 11 November 2002; Published: June 2002
First available in Project Euclid: 18 June 2022

Digital Object Identifier: 10.55937/sut/1057898665

Primary: 05C70

Keywords: subgraph , vertex-disjoint

Rights: Copyright © 2002 Tokyo University of Science

Vol.38 • No. 2 • June 2002
Back to Top