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 2 of 2 for “"Partition-Connectedness"”.

  1. Connectivity and spanning trees of graphs

    … and that of Boonyasombat for hypergraphs.;5. Partition connectivity augmentation and preservation. Let k be a positive integer. A hypergraph H is k-partition-connected if for every partition P of V(H), there are at least k(| P| -- 1) hyperedges intersecting at least two classes of P. We …

    wvu Repository record for Connectivity and spanning trees of graphs (opens in a new tab)

  2. On Generalizations of Supereulerian Graphs

    … In Chapter 5, utilizing the notion of partition-connectedness of hypergraphs introduced by Frank, Kir\'aly and Kriesell in 2003, we generalize the above-mentioned results of Harary and Nash-Williams, of Jaeger and of Catlin to hypergraphs by characterizing hypergraphs whose line graphs …

    wvu Repository record for On Generalizations of Supereulerian Graphs (opens in a new tab)