Results 231 to 240 of about 45,743 (261)

Spatiotemporal disparity of breast cancer incidence in Iranian female populations at the district level from 2000 to 2021: Bayesian disease mapping. [PDF]

PLoS One
Rahimzadeh S, Bentham J, Burczynska B, Farzadfar F, Di Cesare M.   +4 more
europepmc   +1 more source

The Brooks-Chacon Biting Lemma and the Baum-Katz Theorem Along Subsequences

George Stoica, Deli Li, Liping Liu
openalex   +2 more sources

Global, regional, and national burden of gout, 1990-2020, and projections to 2050: a systematic analysis of the Global Burden of Disease Study 2021. [PDF]

Lancet Rheumatol
GBD 2021 Gout Collaborators.
europepmc   +1 more source

Brooks' theorem for signed graphs with ∆ = 3

Reza Naserasr, Huan Zhou
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On Brooks' Theorem for Sparse Graphs

Combinatorics, Probability and Computing, 1995
Let G be a graph with maximum degree Δ(G). In this paper we prove that if the girth g(G) of G is greater than 4 then its chromatic number, χ(G), satisfieswhere o(l) goes to zero as Δ(G) goes to infinity. (Our logarithms are base e.) More generally, we prove the same bound for the list-chromatic (or choice) number:provided g(G) < 4.
openaire   +1 more source

Brooks-type theorems for choosability with separation

Journal of Graph Theory, 1998
Among other results the following variant of the Brooks theorem is shown: A graph with maximum vertex degree \(h\) is \((\lceil \sqrt{5,437(h-1)} \rceil, 1, \lceil \sqrt{5,437(h-1)}\rceil-1)\)-choosable. The proof of this result is nonconstructive.
Kratochvíl, J., Tuza, Zsolt, Voigt, Margit   +2 more
openaire   +3 more sources

A Brooks‐Type Theorem for the Bichromatic Number

Journal of Graph Theory, 2014
AbstractA classical theorem of Brooks in graph coloring theory states that every connected graph G has its chromatic number less than or equal to its maximum degree , unless G is a complete graph or an odd cycle in which case is equal to . Brooks' theorem has been extended to list colorings by Erdős, Rubin, and Taylor (and, independently, by Vizing ...
Epple, Dennis D. A., Huang, Jing
openaire   +1 more source

Cafiero and Brooks–Jewett theorems for Vitali spaces

Ricerche di Matematica, 2007
In this paper \(G\) is a commutative Hausdorff topological group, \(E\) be a Vitali space with SIP (Subsequential Interpolation Property), and \[ \sum(E) = \{ \{ x_{n} \} \subset E_{+}: \text{ the sequence } \sum_{(i=1)}^{n} x_{i} \text{ is bounded }\}. \] The author extends the well-known theorems of Brooks-Jewett and Cafiero about a sequence of \(G\)-
openaire   +3 more sources

Brooks’ Theorem and Circle Packings

2009
Which geometrically finite subgroups G of Isom(H3) are contained in the lattices Г in Isom(H3)? It is clear that there are only countably many lattices Г and there is a continuum of geometrically finite subgroups G ⊂ Isom(H3). In this chapter, we present a theorem of R. Brooks that asserts that in some sense geometrically finite subgroups G ⊂ Isom(H3),
openaire   +1 more source

An Extension of Brook's Theorem

1992
Publisher Summary This chapter presents an extension of Brook's theorem. Some examples are also discussed. The well-known Brook's theorem can be formulated as follows: (1) if a connected graph G does not contain K 1, k + 1, k ≥ 3, then G is k -colorable unless G = k + 1, (2) let T be a tree on k + 2 vertices, k ≥ 3.
openaire   +1 more source