This paper addresses a problem posed by Oxley (Matroid Theory, Cambridge University Press, Cambridge, 1992) for matroids.We shall show that ifG is a 2-connected graph which is not a multiple edge, and which has no K5-minor, then G has two edge-disjoint non-trivial bonds B for which G/B is 2-connected. © 2004 Elsevier Inc. All rights reserved. MSC: 05C38; 05C40; 05C70

In this note, we consider the problem of existence of an edgedecomposition of a multigraph into isomorphic copies of 2-edge paths K1,2. We find necessary and sufficient conditions for such a decomposition of a multigraph H to exist when (i) either H does not have incident multiple edges or (ii) multiplicities of the edges in H are not greater than two. In particular, we answer a problem stated ...

This paper present an effective method to accurately reconstruct and measure the 3D curve edges of small industrial parts based on stereo vision. To effectively fit the curve of the measured parts using a series of line segments in the images, a strategy from coarse to fine is employed based on multi-scale curve fitting. After reconstructing the 3D curve of a hole through a curved surface, its ...

the edges of an image define the image boundary. when the image is noisy, it does not become easy to identify the edges. therefore, a method requests to be developed that can identify edges clearly in a noisy image. many methods have been proposed earlier using filters, transforms and wavelets with ant colony optimization (aco) that detect edges. we here used aco for edge detection of noisy ima...

PETŘÍK MICHAL, BARTOŇ STANISLAV. 2016. Optimization of the Municipal Waste Collection Route Based on the Method of the Minimum Pairing. Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 64(3): 847–854. In the present article is shown the use of Maple program for processing of data describing the position of municipal waste sources and topology of collecting area. The data ...

In order to motivate Baranyai's Theorem, let us present an example. Think of the director of a round{ robin tournament (for instance, a football pool or a chess tournament) who has to schedule the rounds of the tournament in such a way that i) each team plays against each other team exactly once, ii) in every round all the teams are occupied, i. e. they have an opponent. Of course, the second r...

We study a game played on a graph by two players, named Maximizer and Minimizer. Each round two new vertices are chosen; first Maximizer chooses a vertex u that has at least one unchosen neighbor and then Minimizer chooses a neighbor of u. This process eventually produces a maximal matching of the graph. Maximizer tries to maximize the number of edges chosen, while Minimizer tries to minimize i...

We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden graph. This model has been studied for particular classes of graphs by Kucherov and Grebinski [7] and Alon et al.[3], motivated by problems arising in genome sequencing. We give an adaptive deterministic algorithm that lea...

We study the problem of fixturing a chain of hinged objects in a given placement with frictionless point contacts. We define the notions of immobility and robust immobility, which are comparable to second and first order immobility for a single object [8, 7, 11, 12] robust immobility differs from immobility in that it additionally requires insensitivity to small perturbations of contacts. We sh...