Partitioning powers of traceable or hamiltonian graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2014

Partitioning powers of traceable or hamiltonian graphs

Résumé

A graph G =(V,E) is arbitrarily partitionable (AP) if for any sequence τ =(n1,...,np) of positive integers adding up to the order of G , there is a sequence of mutually disjoint subsets of V whose sizes are given by τ and which induce connected graphs. If, additionally, for given k, it is possible to prescribe l = min{k, p} vertices belonging to the first l subsets of τ, G is said to be AP+k. The paper contains the proofs that the kth power of every traceable graph of order at least k is AP + (k − 1) and that the kth power of every hamiltonian graph of order at least 2k is AP + (2k − 1), and these results are tight.

Dates et versions

hal-00919048 , version 1 (16-12-2013)

Identifiants

Citer

Olivier Baudon, Julien Bensmail, Jakub Przybylo, Mariusz Woźniak. Partitioning powers of traceable or hamiltonian graphs. Theoretical Computer Science, 2014, 520, http://dx.doi.org/10.1016/j.tcs.2013.10.016. ⟨10.1016/j.tcs.2013.10.016⟩. ⟨hal-00919048⟩

Collections

CNRS TDS-MACS
61 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More