On the Cartesian product of an arbitrarily partitionable graph and a traceable graph - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2014

On the Cartesian product of an arbitrarily partitionable graph and a traceable graph

Résumé

A graph G of order n is called arbitrarily partitionable (AP, for short) if, for every sequence τ = (n1 , . . . , nk ) of positive integers that sum up to n, there exists a partition (V1 , . . . , Vk ) of the vertex set V (G) such that each set Vi induces a connected subgraph of order ni. A graph G is called AP+1 if, given a vertex u ∈ V (G) and an index q ∈ {1, . . . , k}, such a partition exists with u ∈ Vq . We consider the Cartesian product of AP graphs. We prove that if G is AP+1 and H is traceable, then the Cartesian product GxH is AP+1. We also prove that GxH is AP, whenever G and H are AP and the order of one of them is not greater than four.
Fichier principal
Vignette du fichier
BBKMPW12.pdf (203.58 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00756971 , version 1 (24-11-2012)

Identifiants

  • HAL Id : hal-00756971 , version 1

Citer

Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, et al.. On the Cartesian product of an arbitrarily partitionable graph and a traceable graph. Discrete Mathematics and Theoretical Computer Science, 2014, 16 (2), pp.225-232. ⟨hal-00756971⟩

Collections

CNRS TDS-MACS
225 Consultations
122 Téléchargements

Partager

Gmail Facebook X LinkedIn More