More Aspects of Arbitrarily Partitionable Graphs

Autor:	Bensmail Julien, Li Binlong
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	arbitrarily partitionable graphs partition into connected subgraphs hamiltonicity 05c15 05c40 05c69 68r10 Mathematics QA1-939
Zdroj:	Discussiones Mathematicae Graph Theory, Vol 42, Iss 4, Pp 1237-1261 (2022)
Druh dokumentu:	article
ISSN:	2083-5892
DOI:	10.7151/dmgt.2343
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/a4309b671ba54f0c9c9ba42cd85783ba Zobrazit plný text záznamu View record in DOAJ Plný text ve formátu PDF