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 “"excluded minor characterization"”.

  1. Excluded-minor characterization of apex-outerplanar graphs

    … known that the class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K_4 and K_{2,3}. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed. We provide the complete list of 57 excluded minors for this …

    lsu-thes Repository record for Excluded-minor characterization of apex-outerplanar graphs (opens in a new tab)

  2. The search for an excluded minor characterization of ternary Rayleigh matroids

    … known if this class has a finite set of minimal excluded minors. At this time, it seems unlikely that this is the case. It has been shown that there is a single minimal excluded minor for the smaller class of binary Rayleigh matroids [5]. The aim of this thesis is to detail our search for the set …

    waterloo Repository record for The search for an excluded minor characterization of ternary Rayleigh matroids (opens in a new tab)

  3. Formalizing the Excluded Minor Characterization of Binary Matroids in the Lean Theorem Prover

    … GF(2) by noncontainment of U2,4 as a matroid minor. In this thesis, we document a formalization of the theorem and its proof in the Lean Theorem Prover, building on its community-built mathematics library, mathlib.

    waterloo Repository record for Formalizing the Excluded Minor Characterization of Binary Matroids in the Lean Theorem Prover (opens in a new tab)

  4. Circle Graph Obstructions

    … we present a self-contained proof of Bouchet’s characterization of the class of circle graphs. The proof uses signed graphs and is analogous to Gerards’ graphic proof of Tutte’s excluded-minor characterization of the class of graphic matroids.

    waterloo Repository record for Circle Graph Obstructions (opens in a new tab)

  5. Excluded minors for nearly-paving matroids

    … whether or not M belongs to a given class. An excluded minor of a minor-closed class is a matroid N that is, in a sense, minimal with respect to not being in the minor-closed class. An attractive way to characterize a minor-closed class of matroids is to determine the complete list of excluded …

    csusb Repository record for Excluded minors for nearly-paving matroids (opens in a new tab)

  6. Counting Bases

    … case that the pair is non-Pfaffian, we obtain a characterization of this associated graph. Pfaffian bipartite graphs are a class of graphs for which the number of perfect matchings can be determined; we show that the class of series-parallel Pfaffian matroid pairs is an extension of the class of …

    waterloo Repository record for Counting Bases (opens in a new tab)