Results 281 to 290 of about 119,953 (318)

Factors Driving Background Choice in Scorpionfish. [PDF]

Ecol Evol
John L, Santon M, Michiels NK.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Conflict‐free chromatic number versus conflict‐free chromatic index

Journal of Graph Theory, 2021
AbstractA vertex coloring of a given graph is conflict‐free if the closed neighborhood of every vertex contains a unique color (i.e., a color appearing only once in the neighborhood). The minimum number of colors in such a coloring is the conflict‐free chromatic number of , denoted .
Dębski, Michał, Przybyło, Jakub
openaire   +1 more source

Graphs Whose Circular Chromatic Number Equals the Chromatic Number

Combinatorica, 1999
The circular chromatic number of a graph is the infimum (in fact, the minimum) of \({k}/{d}\) where there is a coloring \(f\) of the vertices with colors \(1,2,\dots,k\) in such a way that \(d\leq | f(x)-f(y)| \leq k-d\) holds when \(x\), \(y\) are adjacent.
openaire   +2 more sources

Chromatic Scheduling and the Chromatic Number Problem

Management Science, 1972
The chromatic scheduling problem may be defined as any problem in which the solution is a partition of a set of objects. Since the partitions may not be distinct, redundant solutions can be generated when partial enumeration techniques are applied to chromatic scheduling problems. The necessary theory is developed to prevent redundant solutions in the
openaire   +1 more source

Chromatic Number

1999
Abstract Erdos and Hajnal (1966) and Lovász (1968, 1968a) were apparently the first to consider (weak) vertex-colourings of hypergraphs. Somewhat later, Berge (1973) formalized the notions of weak and strong chromatic numbers of hypergraphs.
Charles J Colbourn, Alexander Rosa
openaire   +1 more source

Star chromatic number

Journal of Graph Theory, 1988
AbstractA generalization of the chromatic number of a graph is introduced such that the colors are integers modulo n, and the colors on adjacent vertices are required to be as far apart as possible.
openaire   +1 more source

Edge‐face chromatic number and edge chromatic number of simple plane graphs

Journal of Graph Theory, 2005
AbstractGiven a simple plane graph G, an edge‐face k‐coloring of G is a function ϕ : E(G) ∪ F(G) →  {1,…,k} such that, for any two adjacent or incident elements a, b ∈ E(G) ∪ F(G), ϕ(a) ≠ ϕ(b). Let χe(G), χef(G), and Δ(G) denote the edge chromatic number, the edge‐face chromatic number, and the maximum degree of G, respectively. In this paper, we prove
Luo, Rong, Zhang, Cun-Quan
openaire   +2 more sources

On the Strong Chromatic Number

Combinatorics, Probability and Computing, 2004
The author proves that for every finite graph \(G\) the strong chromatic number of \(G\) is at most \(3\Delta(G)-1\), where \(\Delta(G)\) is the maximum vertex degree of \(G\).
openaire   +2 more sources

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller, Leticia M Nogueira, Angela B Mariotto   +2 more
exaly  

Chromatic Number

2021
openaire   +1 more source