Dense Arbitrarily Partitionable Graphs
A graph G of order n is called arbitrarily partitionable (AP for short) if, for every sequence (n1, . . . , nk) of positive integers with n1 + ⋯ + nk = n, there exists a partition (V1, . . . , Vk) of the vertex set V (G) such that Vi induces a connected subgraph of order ni for i = 1, . . . , k. In...
Furkejuvvon:
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
University of Zielona Góra
2016-02-01
|
| Ráidu: | Discussiones Mathematicae Graph Theory |
| Fáttát: | |
| Liŋkkat: | https://doi.org/10.7151/dmgt.1833 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|