Forbidden Subgraphs Generating Almost All Claw-Free Graphs with High Connectivity
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.9 pp.987-993
- Publication Date
- 2019/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.987
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
- Graph algorithms
Authors
Michitaka FURUYA
Kitasato University
Maho YOKOTA
Tokyo University of Science
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
