CATALOGO DEI PRODOTTI DELLA RICERCA
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishLet 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.
| Titolo: | On the complexity of digraph packings |
| Autori: | |
| Data di pubblicazione: | 2003 |
| Rivista: | |
| 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. |
| Handle: | http://hdl.handle.net/11562/409618 |
| Appare nelle tipologie: | 01.01 Articolo in Rivista |
File in questo prodotto:
http://hdl.handle.net/11562/409618
Copyright © 2021