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 126 for “"Colorings"”.

  1. Colorings and list colorings of graphs and hypergraphs

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-04-04T13:50:38Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 3 thesis.tex: 208138 bytes, checksum: 3f2bbfe42b155982f3fe9f0f51b4e863 (MD5) config1.eps: 12369 bytes, checksum: …

    uiuc Repository record for Colorings and list colorings of graphs and hypergraphs (opens in a new tab)

  2. Reconfiguring Graph Colorings

    … others. We show that reconfiguration of acyclic colorings is PSPACE-hard, and that for non-bipartite graphs with chromatic number 3 there exist two k-acylic colorings $f_s$ and $f_e$ such that there is no sequence of transformations that can transform $f_s$ to $f_e$. We also consider the problem …

    waterloo Repository record for Reconfiguring Graph Colorings (opens in a new tab)

  3. Generalized Colorings of Graphs

    … results on the minimum fractional defect of 2-colorings of some graphs. We also propose some open questions and conjectures. Given a (not necessarily proper) vertex coloring of a graph, a subgraph is called rainbow if all its vertices receive different colors, and monochromatic if all its …

    clemson Repository record for Generalized Colorings of Graphs (opens in a new tab)

  4. Rainbow Colorings in Graphs

    In this thesis, we deal with rainbow colorings of graphs. We engage not with the rainbow connection number but with counting of rainbow colorings in graphs with k colors. We introduce the rainbow polynomial and prove some results for some special graph classes. Furthermore, we obtain bounds for the …

    qucosa-diss

  5. Graphs, codes, and colorings

    Item withdrawn by Alexis Thompson (athmpsn1@illinois.edu) on 2010-11-24T20:52:49Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Kantor_Ida.pdf: 588064 bytes, checksum: ed396002d8eb12e47e04cf8040eb7e99 (MD5)

    uiuc Repository record for Graphs, codes, and colorings (opens in a new tab)

  6. Edge colorings of graphs on surfaces and star edge colorings of sparse graphs

    In my dissertation, I present results on two types of edge coloring problems for graphs. For each surface Σ, we define ∆(Σ) = max{∆(G)| G is a class two graph with maximum degree ∆(G) that can be embedded in Σ}. Hence Vizing’s Planar Graph Conjecture can be restated as ∆(Σ) = 5 if Σ is a sphere. …

    wvu Repository record for Edge colorings of graphs on surfaces and star edge colorings of sparse graphs (opens in a new tab)

  7. Interval Edge-Colorings of Graphs

    … of integers). The notion of interval edge-colorings was first introduced by Asratian and Kamalian in 1987, motivated by the problem of finding compact school timetables. In 1992, Hansen described another scenario using interval edge-colorings to schedule parent-teacher conferences so that …

    ucf Repository record for Interval Edge-Colorings of Graphs (opens in a new tab)

  8. Four local colorings of graphs

    A power coloring of a graph G is a mapping c : V (G) → N that assigns colors to the vertices of G in such a way that adjacent vertices are labeled with different colors. A coloring c is called a 4-local coloring if for every subset S ⊆ V (G), with 2 ≤ |S| ≤ 4 there are two vertices u, v such that …

    unlv Repository record for Four local colorings of graphs (opens in a new tab) Download PDF for Four local colorings of graphs (opens in a new tab)

  9. Graph Homomorphisms and Vector Colorings

    … when such graphs admit unique vector colorings. We present this characterization, as well as several important consequences discussed in [5, 6]. By appealing to this characterization, several important families of graphs, including Kneser graphs, Quantum Kneser graphs, and Hamming …

    south-carolina Repository record for Graph Homomorphisms and Vector Colorings (opens in a new tab)

  10. Realizable triples in dominator colorings

    Given a graph G and its vertex set V(G), the chromatic number, Chi(G), represents the minimum number of colors required to color the vertices of G so that no two adjacent vertices have the same color. The domination number of G, gamma(G), the minimum number of vertices in a set S, where every …

    nps Repository record for Realizable triples in dominator colorings (opens in a new tab)

  11. Neighborhood-Restricted Achromatic Colorings of Graphs

    A (closed) neighborhood-restricted 2-achromatic-coloring of a graph G is an assignment of colors to the vertices of G such that no more than two colors are assigned in any closed neighborhood. In other words, for every vertex v in G, the vertex v and its neighbors are in at most two different color …

    etsu Repository record for Neighborhood-Restricted Achromatic Colorings of Graphs (opens in a new tab) Download PDF for Neighborhood-Restricted Achromatic Colorings of Graphs (opens in a new tab)

  12. Formal group laws and hypergraph colorings

    … is a sum of monomials corresponding to proper colorings of $H$. Our main result gives a combinatorial interpretation for certain formal group laws. In particular, we show that if $f(x)$ is a generating function for a type of combinatorial object with a certain recursive structure then the …

    washington Repository record for Formal group laws and hypergraph colorings (opens in a new tab)

  13. 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)

  14. Extremal problems on special graph colorings

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

    uiuc Repository record for Extremal problems on special graph colorings (opens in a new tab)

  15. Algebraic Analysis of Vertex-Distinguishing Edge-Colorings

    Vertex-distinguishing edge-colorings (vdec colorings) are a restriction of proper edge-colorings. These special colorings require that the sets of edge colors incident to every vertex be distinct. This is a relatively new field of study. We present a survey of known results concerning vdec …

    waterloo Repository record for Algebraic Analysis of Vertex-Distinguishing Edge-Colorings (opens in a new tab)

Page 1 of 7