Multigraph decomposition into multigraphs with two underlying edges

Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H, is probably not feasible if the underlying simple graph of H has three or more edges. We study the case where H...

Descripció completa

Dades bibliogràfiques

Autors principals:	Miri Priesler, Michael Tarsi
Format:	Artigo
Idioma:	Inglês
Publicat:	Discrete Mathematics & Theoretical Computer Science 2005-01-01
Col·lecció:	Discrete Mathematics & Theoretical Computer Science
Matèries:	decomposition multigraph npc [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
Accés en línia:	https://dmtcs.episciences.org/3405/pdf
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!