496 search results - page 68 / 100 » C4-saturated bipartite graphs |
160
click to vote
DM
2000
15 years 6 months ago
2000
The Zarankiewicz number z(s, m) is the maximum number of edges in a subgraph of K(s, s) that does not contain K(m, m) as a subgraph. The bipartite Ramsey number b(m, n) is the lea...
163
click to vote
JGT
2011
15 years 1 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
157
click to vote
DAM
2002
15 years 6 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
167
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
204
click to vote
ECSQARU
2009
Springer
16 years 23 days ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...