Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/14399
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTipnis, Shailesh K-
dc.date.accessioned2015-09-03T10:31:59Z-
dc.date.available2015-09-03T10:31:59Z-
dc.date.issued2015-08-28-
dc.identifier.urihttp://hdl.handle.net/11718/14399-
dc.descriptionThe R & P seminar held at Wing 11 Committee Room, IIM Ahmedabad on August 28, 2015 by Prof. Shailesh K. Tipnis, Illinois State University, USA on "On Path Decompositions of Graphs and Multigraphs".en_US
dc.description.abstractFor graphs G and H, graph G is said to admit an H-decomposition if the edges of G can be partitioned into isomorphic copies of H. Let P4 denote the path on 4 vertices. We survey results that assert that certain graphs and multigraphs admit a P4 decomposition. We then prove that unless P = NP some of these results are best possible by proving that their extensions are NP-complete. The positive results and the NP-complete results provide evidence for a conjecture about P4 decomposability of even-regular multigraphs.en_US
dc.language.isoenen_US
dc.publisherIndian Institute of Management, Ahmedabaden_US
dc.subjectDecompositionsen_US
dc.subjectMultigraphsen_US
dc.subjectGraphs and Multigraphsen_US
dc.subjectH-decompositionen_US
dc.titleOn Path Decompositions of Graphs and Multigraphsen_US
dc.typeVideoen_US
Appears in Collections:R & P Seminar

Files in This Item:
File Description SizeFormat 
IIMA_28_08_2015.mp4IIMA_28_08_2015247.17 MBMP4 VideoView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.