Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

JGT
2008

favoriteEmaildiscussreport

88views more JGT 2008»

On minimum sets of 1-factors covering a complete multipartite graph

13 years 4 months ago

On minimum sets of 1-factors covering a complete multipartite graph

Download www.math.sinica.edu.tw

We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1-factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. MSC 2000: Primary 05C70; Secondary 05C15.

David Cariolaro, Hung-Lin Fu

Real-time Traffic

Complete Multipartite Graph | JGT 2008 | Sufficient Conditions |

claim paper

Related Content

» Fractional Vertex Arboricity of Graphs

» A parameterized algorithm for Chordal Sandwich

» On the Crossing Spanning Tree Problem

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JGT
Authors	David Cariolaro, Hung-Lin Fu

Comments (0)