On the complexity of digraph packings

  • Authors:

  • Richard C. Brewster;Romeo Rizzi

  • Affiliations:

  • Computer Science Department, Bishop's University, Lennoxville, Quebec, Canada, J1M 1Z7;Dipartimento di Informatica e Telecomunicazioni, Università di Trento, via Sommarvie 14, 38050 Povo, Italy

  • Venue:
  • Information Processing Letters
  • Year:
  • 2003

Quantified Score

Hi-index 0.89

Visualization

Abstract

Let G be a fixed collection of digraphs. Given a digraph H, a G-packing of H is a collection of vertex disjoint subgraphs of H, each isomorphic to a member of G. For undirected graphs, Loebl and Poljak have completely characterized the complexity of deciding the existence of a perfect G-packing, in the case that G consists of two graphs one of which is a single edge on two vertices. We characterize G-packing where G consists of two digraphs one of which is a single arc on two vertices.