More Aspects of Arbitrarily Partitionable Graphs
A graph G of order n is arbitrarily partitionable (AP) if, for every sequence (n1, . . ., np) partitioning n, there is a partition (V1, . . ., ,Vp) of V (G) such that G[Vi] is a connected ni-graph for i = 1, . . ., p. The property of being AP is related to other well-known graph notions, such as per...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2022-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2343 |
| _version_ | 1797760643179216896 |
|---|---|
| author | Bensmail Julien Li Binlong |
| author_facet | Bensmail Julien Li Binlong |
| author_sort | Bensmail Julien |
| collection | DOAJ |
| description | A graph G of order n is arbitrarily partitionable (AP) if, for every sequence (n1, . . ., np) partitioning n, there is a partition (V1, . . ., ,Vp) of V (G) such that G[Vi] is a connected ni-graph for i = 1, . . ., p. The property of being AP is related to other well-known graph notions, such as perfect matchings and Hamiltonian cycles, with which it shares several properties. This work is dedicated to studying two aspects behind AP graphs. |
| first_indexed | 2024-03-12T19:01:31Z |
| format | Article |
| id | doaj.art-a4309b671ba54f0c9c9ba42cd85783ba |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T19:01:31Z |
| publishDate | 2022-11-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-a4309b671ba54f0c9c9ba42cd85783ba2023-08-02T06:34:51ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922022-11-014241237126110.7151/dmgt.2343More Aspects of Arbitrarily Partitionable GraphsBensmail Julien0Li Binlong1Université Côte d’Azur, CNRS, Inria, I3S, FranceDepartment of Applied Mathematics, Northwestern Polytechnical University, Xi’an, Shaanxi 710072, P.R.ChinaA graph G of order n is arbitrarily partitionable (AP) if, for every sequence (n1, . . ., np) partitioning n, there is a partition (V1, . . ., ,Vp) of V (G) such that G[Vi] is a connected ni-graph for i = 1, . . ., p. The property of being AP is related to other well-known graph notions, such as perfect matchings and Hamiltonian cycles, with which it shares several properties. This work is dedicated to studying two aspects behind AP graphs.https://doi.org/10.7151/dmgt.2343arbitrarily partitionable graphspartition into connected subgraphshamiltonicity05c1505c4005c6968r10 |
| spellingShingle | Bensmail Julien Li Binlong More Aspects of Arbitrarily Partitionable Graphs Discussiones Mathematicae Graph Theory arbitrarily partitionable graphs partition into connected subgraphs hamiltonicity 05c15 05c40 05c69 68r10 |
| title | More Aspects of Arbitrarily Partitionable Graphs |
| title_full | More Aspects of Arbitrarily Partitionable Graphs |
| title_fullStr | More Aspects of Arbitrarily Partitionable Graphs |
| title_full_unstemmed | More Aspects of Arbitrarily Partitionable Graphs |
| title_short | More Aspects of Arbitrarily Partitionable Graphs |
| title_sort | more aspects of arbitrarily partitionable graphs |
| topic | arbitrarily partitionable graphs partition into connected subgraphs hamiltonicity 05c15 05c40 05c69 68r10 |
| url | https://doi.org/10.7151/dmgt.2343 |
| work_keys_str_mv | AT bensmailjulien moreaspectsofarbitrarilypartitionablegraphs AT libinlong moreaspectsofarbitrarilypartitionablegraphs |