On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2014

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

Abstract

A graph G of order n is called arbitrarily partitionable (AP, for short) if, for every sequence τ=(n1,\textellipsis,nk) of positive integers that sum up to n, there exists a partition (V1,\textellipsis,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,\textellipsis,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 G□ H is AP+1. We also prove that G□H is AP, whenever G and H are AP and the order of one of them is not greater than four.

Keywords

Fichier principal
Vignette du fichier
dmtcs-16-1-14.pdf (4 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01179212 , version 1 (22-07-2015)

Identifiers

Cite

Olivier Baudon, Julien Bensmail, Rafał Kalinowski, Antoni Marczyk, Jakub Przybyło, et al.. On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph. Discrete Mathematics and Theoretical Computer Science, 2014, Vol. 16 no. 1 (1), pp.225--232. ⟨10.46298/dmtcs.1259⟩. ⟨hal-01179212⟩

Collections

CNRS TDS-MACS
132 View
904 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More