496 search results - page 15 / 100 » C4-saturated bipartite graphs |
JGT
2006
13 years 7 months ago
2006
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern disco...
DM
2010
13 years 7 months ago
2010
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
APPML
2007
13 years 7 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...