558 research outputs found
On minimum degree conditions for supereulerian graphs
A graph is called supereulerian if it has a spanning closed trail. Let be a 2-edge-connected graph of order such that each minimal edge cut with satisfies the property that each component of has order at least . We prove that either is supereulerian or belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree : If is a 2-edge-connected graph of order with such that for every edge , we have , then either is supereulerian or belongs to one of two classes of exceptional graphs. We show that the condition cannot be relaxed
On stability of the Hamiltonian index under contractions and closures
The hamiltonian index of a graph is the smallest integer such that the -th iterated line graph of is hamiltonian. We first show that, with one exceptional case, adding an edge to a graph cannot increase its hamiltonian index. We use this result to prove that neither the contraction of an -contractible subgraph of a graph nor the closure operation performed on (if is claw-free) affects the value of the hamiltonian index of a graph
Toughness and hamiltonicity in -trees
We consider toughness conditions that guarantee the existence of a hamiltonian cycle in -trees, a subclass of the class of chordal graphs. By a result of Chen et al.\ 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al.\ there exist nontraceable chordal graphs with toughness arbitrarily close to . It is believed that the best possible value of the toughness guaranteeing hamiltonicity of chordal graphs is less than 18, but the proof of Chen et al.\ indicates that proving a better result could be very complicated. We show that every 1-tough 2-tree on at least three vertices is hamiltonian, a best possible result since 1-toughness is a necessary condition for hamiltonicity. We generalize the result to -trees for : Let be a -tree. If has toughness at least then is hamiltonian. Moreover, we present infinite classes of nonhamiltonian 1-tough -trees for each $k\ge 3
Job Searchers, Job Matches and the Elasticity of Matching
This paper stresses the importance of a specification of the matching function in which the measure of job matches corresponds to the measure of job searchers. In many empirical studies on the matching function this requirement has not been fulfilled because it is difficult to find information about employed job searchers and job searchers from outside the labour market. In this paper, we specify and estimate matching functions where the flow corresponds to the correct stock. We use several approximations for the stock of non-unemployed job searchers. We find that the estimation results are sensitive to the approximation we use. Our main conclusion is that it is important to account for the behaviour of non-unemployed job searchers since otherwise the estimated parameters of the matching function may be seriously biased.unemployment;vacancies;matching
- ā¦