496 search results - page 3 / 100 » C4-saturated bipartite graphs |
SIAMDM
2008
13 years 6 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
COMBINATORICA
2006
13 years 6 months ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
EJC
2007
13 years 6 months ago
2007
We present a new family of locally 5–arc transitive graphs. The graphs constructed are bipartite with valency {2m + 1, 2m}. The actions of the automorphism group on the two bipa...
ICPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Automated visual tracking of cells from video microscopy has many important biomedical applications. In this paper, we model the problem of cell tracking over pairs of video micro...
IPCO
1998
13 years 7 months ago
1998
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...