496 search results - page 12 / 100 » C4-saturated bipartite graphs |
JCO
2000
13 years 7 months ago
2000
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
JCT
2008
13 years 7 months ago
2008
A graph is pseudo 2
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time O(mn),...
SIAMDM
2008
13 years 7 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
ORDER
2008
13 years 7 months ago
2008
We give various constructions of uncountable arc-transitive bipartite graphs employing techniques from partial orders, starting with the cyclefree case, but generalizing to cases ...