Tree in forbidden triples generating a finite set of graphs with high connectivity
For a graph and a set of connected graphs, is said be -free if does not contain any member of as an induced subgraph. For , we let denote the set of all -connected -free graphs. This paper is concerned with integers , and and a tree such that is finite. Among other results, we show that for integers...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.03.021 |
| Summary: | For a graph and a set of connected graphs, is said be -free if does not contain any member of as an induced subgraph. For , we let denote the set of all -connected -free graphs. This paper is concerned with integers , and and a tree such that is finite. Among other results, we show that for integers , , and with , and , the diameter of a tree such that is finite is bounded above by a constant which depends only on but not on , or . |
|---|---|
| ISSN: | 0972-8600 2543-3474 |