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...

Full description

Bibliographic Details
Main Authors: Miri Priesler, Michael Tarsi
Format: Article
Language:English
Published: International Institute of Informatics and Cybernetics 2009-06-01
Series:Journal of Systemics, Cybernetics and Informatics
Subjects:
Online Access:http://www.iiisci.org/Journal/CV$/sci/pdfs/ZI514VR.pdf