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.

On the complexity of digraph packings

RIZZI, ROMEO
2003-01-01

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.
2003
graph algorithms; graph packings; computational complexity; dichotomy theorem
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/409618
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact