EUVIMEDEUVIMED entdecken
Crossref

Vertex-Disjoint Copies of K1+(K1∪K2) in Graphs

Shinya Fujita

SUT Journal of Mathematics · 2002

DOI: 10.55937/sut/1057898665 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SUT Journal of Mathematics, 2002. Verfasst von Shinya Fujita. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 4 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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

Zitieren

APA

Fujita, S. (2002). Vertex-Disjoint Copies of K1+(K1∪K2) in Graphs. SUT Journal of Mathematics. https://doi.org/10.55937/sut/1057898665

Vancouver

Fujita S. Vertex-Disjoint Copies of K1+(K1∪K2) in Graphs. SUT Journal of Mathematics. 2002. doi:10.55937/sut/1057898665

BibTeX
@article{Fujita2002,
  author = {Fujita, Shinya},
  title = {Vertex-Disjoint Copies of K1+(K1∪K2) in Graphs},
  journal = {SUT Journal of Mathematics},
  year = {2002},
  doi = {10.55937/sut/1057898665}
}
Kostenlos starten →