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 5 of 5 for “"Star forest"”.

  1. Extremal Problems for Forests in Graphs and Hypergraphs

    … hypergraphs; we focus on the case when F is a forest in graphs and hypergraph. In the first chapter we discuss the history of Turan numbers and give several classical results. In the second chapter, we examine the Turan number for forests with path components, forests of path and star …

    montana Repository record for Extremal Problems for Forests in Graphs and Hypergraphs (opens in a new tab)

  2. Extremal Problems for Forests in Graphs and Hypergraphs

    … hypergraphs; we focus on the case when F is a forest in graphs and hypergraph. In the first chapter we discuss the history of Turan numbers and give several classical results. In the second chapter, we examine the Turan number for forests with path components, forests of path and star …

    montana-tech Repository record for Extremal Problems for Forests in Graphs and Hypergraphs (opens in a new tab)

  3. Agroindústria canavieira e unidade de conservação: Impactos Sociais na comunidade de pescadores de Baía Formosa (RN)

    … to the environmental damages. In the Atlantic Forest of the Brazilian Northeast, the most of the damages come from the sugar-cane agro-industry, especially by the deforestation for the introduction of sugar-cane fields and installation of the industry structure. Besides the damages over the …

    brazil-ufrn Repository record for Agroindústria canavieira e unidade de conservação: Impactos Sociais na comunidade de pescadores de Baía Formosa (RN) (opens in a new tab)

  4. Coloring and covering problems on graphs

    … $\pi_f^\circ(K_{m,m})=\frac{3m-3}{2m-1}$. A \emph{star $k$-coloring} is a proper $k$-coloring where the union of any two color classes induces a star forest. While every planar graph is 4-colorable, not every planar graph is star 4-colorable. One method to produce a star 4-coloring is to partition …

    uiuc Repository record for Coloring and covering problems on graphs (opens in a new tab)

  5. Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα

    In this dissertation, we study issues arising in wireless communication networks, i.e., networks based on telecommunication infrastructure like cellular wireless networks, networks of autonomous wireless transmitters like ad hoc wireless networks, and so on. Wireless networks have received …

    greece Repository record for Αποδοτικοί αλγόριθμοι για την κατανομή ενέργειας σε ασύρματα δίκτυα (opens in a new tab)