Sciweavers

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

16

DM
2006

favoriteEmaildiscussreport

103views more DM 2006»

Bounds on the forcing numbers of bipartite graphs

13 years 4 months ago

Bounds on the forcing numbers of bipartite graphs

Download graph.cs.ntust.edu.tw

The forcing number of a perfect matching M of a graph G is the cardinality of the smallest subset of M that is contained in no other perfect matching of G. In this paper, we demonstrate several techniques to produce upper bounds on the forcing number of bipartite graphs. We present a simple method of showing that the maximum forcing number on the 2m

Seth Kleinerman

Real-time Traffic

DM 2006 | Maximum Forcing Number | Perfect Matching | Smallest Subset |

claim paper

Related Content

» A New Algorithm for Online Coloring Bipartite Graphs

» Sum Coloring of Bipartite Graphs with Bounded Degree

» Bipartite Ramsey numbers and Zarankiewicz numbers

» Star forests dominating sets and Ramseytype problems

» Characterizations of bipartite Steinhaus graphs

» Routing Numbers of Cycles Complete Bipartite Graphs and Hypercubes

» Fast load balancing via bounded best response

» Monomulti bipartite Ramsey numbers designs and matrices

» Graphs with bounded treewidth and large oddgirth are almost bipartite

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DM
Authors	Seth Kleinerman

Comments (0)