The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
가족을 위한 H 연결된 그래프와 정수 k≥1, 하자 Gk(H)는 다음의 가족을 나타냅니다. k- 어떤 요소도 포함하지 않는 연결된 그래프 H 유도된 하위 그래프로. 허락하다 H+ 다음을 포함하는 차수 5의 연결된 그래프의 계열이 됩니다. K1,3 유도된 하위 그래프로. 본 논문에서는 각 정수에 대해 k≥1, 우리는 가족을 특성화합니다 H⊆H+ 대칭적 차이는 Gk(K1,3) and Gk(H)은 유한합니다.
Michitaka FURUYA
Kitasato University
Maho YOKOTA
Tokyo University of Science
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Michitaka FURUYA, Maho YOKOTA, "Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 9, pp. 987-993, September 2019, doi: 10.1587/transfun.E102.A.987.
Abstract: For a family H of connected graphs and an integer k≥1, let Gk(H) denote the family of k-connected graphs which contain no element of H as an induced subgraph. Let H+ be the family of those connected graphs of order 5 which contain K1,3 as an induced subgraph. In this paper, for each integer k≥1, we characterize the families H⊆H+ such that the symmetric difference of Gk(K1,3) and Gk(H) is finite.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.987/_p
부
@ARTICLE{e102-a_9_987,
author={Michitaka FURUYA, Maho YOKOTA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity},
year={2019},
volume={E102-A},
number={9},
pages={987-993},
abstract={For a family H of connected graphs and an integer k≥1, let Gk(H) denote the family of k-connected graphs which contain no element of H as an induced subgraph. Let H+ be the family of those connected graphs of order 5 which contain K1,3 as an induced subgraph. In this paper, for each integer k≥1, we characterize the families H⊆H+ such that the symmetric difference of Gk(K1,3) and Gk(H) is finite.},
keywords={},
doi={10.1587/transfun.E102.A.987},
ISSN={1745-1337},
month={September},}
부
TY - JOUR
TI - Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 987
EP - 993
AU - Michitaka FURUYA
AU - Maho YOKOTA
PY - 2019
DO - 10.1587/transfun.E102.A.987
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2019
AB - For a family H of connected graphs and an integer k≥1, let Gk(H) denote the family of k-connected graphs which contain no element of H as an induced subgraph. Let H+ be the family of those connected graphs of order 5 which contain K1,3 as an induced subgraph. In this paper, for each integer k≥1, we characterize the families H⊆H+ such that the symmetric difference of Gk(K1,3) and Gk(H) is finite.
ER -