Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Ear decomposition"”.

  1. Brick Generation and Conformal Subgraphs

    … edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played key roles in the theory of these graphs. Any tight cut decomposition of a matching covered graph results in an essentially unique list of …

    waterloo Repository record for Brick Generation and Conformal Subgraphs (opens in a new tab)

  2. On the independent spanning tree conjectures and related problems

    … Spanning Tree Conjecture using a graph decomposition similar to an ear decomposition, and give polynomial-time algorithms to construct the decomposition and the trees. We provide alternate geometric proofs for the cases k = 3 of both the Independent Spanning Tree Conjecture and …

    gatech Repository record for On the independent spanning tree conjectures and related problems (opens in a new tab)

  3. Poset Convex-Ear Decompositions and Applications to the Flag h-Vector

    … geometric and algebraic combinatorics. A convex-ear decomposition, first introduced by Chari, is a way of writing a simplicial complex as a union of subcomplexes of simplicial polytope boundaries. When a $(d-1)$-dimensional complex admits such a decomposition, its h-vector satisfies, for $i < …

    cornell Repository record for Poset Convex-Ear Decompositions and Applications to the Flag h-Vector (opens in a new tab)

  4. On the g2-number of various classes of spheres and manifolds

    … simplicial sphere do not necessarily have an ear decomposition. A simplicial complex is flag if it is the clique complex of its graph. In Chapter 4, we settle the Upper Bound Conjecture for flag 3-manifolds, establish a sharp upper bound on the number of edges of flag 5-manifolds and …

    washington Repository record for On the g2-number of various classes of spheres and manifolds (opens in a new tab)

  5. Broadcasting in highly connected graphs

    … decades the problem has been studied by many researchers and all have come to demonstrate that despite its easy definition, the problem of broadcasting does not have trivial properties and symmetries. For general graphs, and even for some very restricted classes of graphs, the question of finding …

    concordia Download PDF for Broadcasting in highly connected graphs (opens in a new tab)

  6. Πειραματικοί σχεδιασμοί και γραφήματα

    This dissertation presents a research on the construction of experimental designs, which is the first of the three objects of Statistics (according to R.A. Fisher, while the other two are Descriptive Statistics and Statistical Inference). In particular it is a study on the saturated D-optimal, s1 x …

    greece Repository record for Πειραματικοί σχεδιασμοί και γραφήματα (opens in a new tab)