Forbidden subgraphs that imply Hamiltonian-connectedness

It is proven that if $G$ is a $3$-connected claw-free graph which is also $Z_3$-free (where $Z_3$ is a triangle with a path of length $3$ attached), $P_6$-free (where $P_6$ is a path with $6$ vertices) or $H_1$-free (where $H_1$ consists of two disjoint triangles connected by an edge), then $G$ is Hamiltonian-connected. Also, examples will be described that determine a finite family of graphs $\cal{L}$ such that if a 3-connected graph being claw-free and $L$-free implies $G$ is Hamiltonian-connected, then $L\in\cal{L}$. \u

Decomposition of bipartite graphs under degree constraints

Let G = (A, B; E) be a bipartite graph. Let e1, e2 be nonnegative integers, and f1, f2 nonnegative integer-valued functions on V(G) such that ei ≤|E|≤ e1 + e2 and fi(v)≤d(v)≤f1(v) + f2(v) for all v ε V(G) (i = 1, 2). Necessary and sufficient conditions are obtained for G to admit a decomposition in spanning subgraphs G1 = (A, B; E1) and G2 = (A, B; E2) such that |Ei|≤ei and dGi(v)≤fi(v) for all v ε V(G) (i = 1, 2). The result generalizes a known characterization of bipartite graphs with a k-factor. Its proof uses flow theory and is a refinement of the proof of an analogous result due to Folkman and Fulkerson. By applying corresponding flow algorithms, the described decomposition can be found in polynomial time if it exists. As an application, an assignment problem is solved

REGIONAL DIFFERENCES IN LABOUR PRODUCTIVITY IN THE NETHERLANDS

One of the major goals of current Dutch economic policy is to increase labour productivity growth. In order to achieve this goal a Dutch innovation platform is established, chaired by the Dutch Prime Minister Balkenende, with the aim to reinforce the innovativeness of the Dutch economy. Innovation has a positive effect on productivity growth (Donselaar et al. 2004). Besides this macro policy goal, the most recent memorandum on regional policy 'Pieken in de Delta'(EZ 2004) makes it clear that enhancing productivity growth is a

Producing and recognizing words with two pronunciation variants: Evidence from novel schwa words

This study examined the lexical representations and psycholinguistic mechanisms underlying the production and recognition of novel words with two pronunciation variants in French. Participants first learned novel schwa words (e.g., /ʃənyk/), which varied in their alternating status (i.e., whether these words were learned with one or two variants) and, for alternating words, in the frequency of their variants. They were then tested in picture-naming (free or induced) and recognition memory tasks (i.e., deciding whether spoken items were learned during the experiment or not). Results for free naming show an influence of variant frequency on responses, more frequent variants being produced more often. Moreover, our data show an effect of the alternating status of the novel words on naming latencies, with longer latencies for alternating than for nonalternating novel words. These induced naming results suggest that both variants are stored as lexical entries and compete during the lexeme selection process. Results for recognition show an effect of variant frequency on reaction times and no effect of variant type (i.e., schwa versus reduced variant). Taken together, our findings suggest that participants both comprehend and produce novel French schwa words using two lexical representations, one for each variant