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 20 of 41 for “"multigraphs"”.

  1. Designs on Cubic Multigraphs

    … for the existence of graph designs on cubic multigraphs. It is shown that, with a few given exceptions, these conditions are sufficient for all connected cubic multigraphs on six or fewer vertices, and for four of the five disconnected ones. Partial results are obtained for the remaining …

    mcmaster Repository record for Designs on Cubic Multigraphs (opens in a new tab)

  2. Multigraphs with High Chromatic Index

    … to edge-colouring by focusing exclusively on multigraphs with high chromatic index. The bulk of our results can be classified into three categories. First, we prove results which aim to characterize those multigraphs achieving known upper bounds. For example, Goldberg's Theorem says that χ'≤ …

    waterloo Repository record for Multigraphs with High Chromatic Index (opens in a new tab)

  3. Almost Envy-Free allocations in multigraphs.

    Η διπλωματική μελετά το πρόβλημα της «δίκαιης» κατανομής αγαθών σε πράκτορες. Η μελέτη του προβλήματος ξεκίνησε στα τέλη της δεκαετίας του 1940 για αγαθά που μπορούν να διαχωριστούν με το πρόβλημα «cake cutting». Υπάρχουν πολλές έννοιες δίκαιου διαμοιρασμού αγαθών όταν αναφερόμαστε στον τομέα της …

    athens Repository record for Almost Envy-Free allocations in multigraphs. (opens in a new tab)

  4. Colorings of sparse graphs and multigraphs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms

    uiuc Repository record for Colorings of sparse graphs and multigraphs (opens in a new tab)

  5. Maximum number of cycles in graphs and multigraphs

    … m edges; graphs with n vertices and m edges; multigraphs with m edges and multigraphs with n vertices and m edges.

    manitoba Repository record for Maximum number of cycles in graphs and multigraphs (opens in a new tab)

  6. Cycle and closed trail decompositions of complete equipartite graphs and complete multigraphs

    … we consider decompositions of complete multigraphs and complete equipartite graphs. The complete multigraph lambdaKm is the multigraph with m vertices and lambda edges between each pair of vertices. The complete equipartite graph Km * Kn with m parts of size n is the simple graph on mn …

    ottawa-retro Repository record for Cycle and closed trail decompositions of complete equipartite graphs and complete multigraphs (opens in a new tab)

  7. Sampling for conditional inference on contingency tables, multigraphs, and high dimensional tables

    … tables with fixed margins, loopless, undirected multigraphs, and high-dimensional tables. In each case, the proposals for the method are constructed by leveraging approximations to the total number of structures (tables, multigraphs, or high-dimensional tables), based on results in the …

    uiuc Repository record for Sampling for conditional inference on contingency tables, multigraphs, and high dimensional tables (opens in a new tab)

  8. Fair division of indivisible items

    … second contribution concerns EFX orientations of multigraphs of goods. We show that deciding whether EFX orientations exist for multigraphs is NP-complete, even for symmetric bi-valued multigraphs. Complementary to this, we show symmetric bi-valued multigraphs that do not contain non-trivial odd …

    uvic Repository record for Fair division of indivisible items (opens in a new tab)

  9. A Predictive Model Which Uses Descriptors of RNA Secondary Structures Derived from Graph Theory.

    … novel graphical invariants to quantify the multigraphs and obtain characteristic descriptors of the secondary structures. These descriptors are used to train an artificial neural network (ANN) to recognize the characteristics of secondary RNA structure. Using the ANN, we classify the …

    etsu Repository record for A Predictive Model Which Uses Descriptors of RNA Secondary Structures Derived from Graph Theory. (opens in a new tab) Download PDF for A Predictive Model Which Uses Descriptors of RNA Secondary Structures Derived from Graph Theory. (opens in a new tab)

  10. Arboricity and transversal problems on bounded degree graphs

    … \rceil$. Using tools from orientations of multigraphs, we prove that the Linear Arboricity Conjecture holds for multigraphs whose maximum degree is sufficiently large compared to a certain maximum density. This improves on previous results of this type, and moreover our methods extend to …

    waterloo Repository record for Arboricity and transversal problems on bounded degree graphs (opens in a new tab)

  11. Synthesis of User Interfaces with Categorical Methods

    … representing user interfaces as directed labeled multigraphs and applying pullback constructions to the category of directed labeled multigraphs, the study formalizes interface structures in a way that encompasses both technical operations and users' perceptual capabilities. Users interact with …

    waterloo Repository record for Synthesis of User Interfaces with Categorical Methods (opens in a new tab)

  12. Heterogeneous Generalizations of Vertex Coloring

    … list coloring analogue of Brooks' Theorem for multigraphs, a result linking group structure (rather than only group size) with group coloring, some results involving coloring edge-disjoint unions, and an examination of the relationship between the group and DP coloring numbers of a multigraph …

    wvu Repository record for Heterogeneous Generalizations of Vertex Coloring (opens in a new tab)

  13. Extremal Results and Algorithms for Degree Sequences of Graphs

    … of single edges (multiplicity 1) among all 2-multigraphs with the same degree sequence. In every parsimonious 2-multigraph, the subgraph of single edges consists of isolated stars and possibly one component that is a triangle. We prove the conjecture of Brualdi and Michael that for any fixed …

    uiuc Repository record for Extremal Results and Algorithms for Degree Sequences of Graphs (opens in a new tab)

  14. Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen

    … we study the discrepancy of hypergraphs and multigraphs. We also combine spectral techniques with approximation algorithms to achieve the new result. Our new algorithm is adaptable for Not-All-Equal-4-SAT and the 2-colouring of 4-uniform hypergraphs. We also extends the Hajos construction of …

    qucosa-diss

  15. Linear systems and Riemann-Roch theory on graphs

    … Riemann-Roch formula for integral divisors on multigraphs. We show that for any subring R of the reals, the Riemann-Roch formula can be generalized to R-valued divisors on edge-weighted graphs over R. We also show that a related abelian sandpile model extended to R on edge-weighted graphs leads …

    colostate Repository record for Linear systems and Riemann-Roch theory on graphs (opens in a new tab)

  16. Constructing Cospectral and Comatching Graphs

    … definition of matching polynomial for multigraphs to derive new identities for the matching polynomial. These identities are tools used towards our 2-sum construction for comatching vertices and comatching graphs.

    waterloo Repository record for Constructing Cospectral and Comatching Graphs (opens in a new tab)

  17. Effects of n>m Clos networks on edge coloring and matrix decomposition algorithms

    … First, edge coloring and matching on bipartite multigraphs are applied to routing on Clos networks. It is demonstrated that edge coloring algorithms which find a minimum edge coloring set up the routing for n > m Clos networks with redundancy. The results presented here indicate that the Euler …

    njit Repository record for Effects of n>m Clos networks on edge coloring and matrix decomposition algorithms (opens in a new tab)

Page 1 of 3