Results 291 to 300 of about 9,612,020 (345)

Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials. [PDF]

Nat Commun
Minev ZK, Najafi K, Majumder S, Wang J, Stern A, Kim EA, Jian CM, Zhu G.   +7 more
europepmc   +1 more source

Green flowers need yellow to get noticed in a green world. [PDF]

Ann Bot
Del Valle JC, León-Osper M, Domínguez-González C, Buide ML, Arista M, Ortiz PL, Whittall JB, Narbona E.   +7 more
europepmc   +1 more source

Lizard polymorphic throat colors are distinguishable by conspecifics and predators across variable light environments. [PDF]

PLoS One
BeVier GT, Brock KM.
europepmc   +1 more source

Encoding hierarchical 3D architecture through inverse design of programmable bonds. [PDF]

Nat Mater
Kahn JS, Minevich B, Michelson A, Emamy H, Wu J, Ji H, Yun A, Kisslinger K, Xiang S, Yu N, Kumar SK, Gang O.   +11 more
europepmc   +1 more source

Larger frogs are better mimics but are more risk-averse in a nontoxic poison frog. [PDF]

Behav Ecol
McEwen BL, Yeager J, Veneat A, Barnett JB.   +3 more
europepmc   +1 more source

On the oriented chromatic number of grids

, 2003
Guillaume Fertin, André Raspaud, Arup Roychowdhury   +2 more
openalex   +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, 2020
A vertex coloring of a given graph G is conflict‐free if the closed neighborhood of every vertex contains a unique color (i.e., a color appearing only once in the neighborhood).
Michał Deͅbski, J. Przybylo
semanticscholar   +2 more sources

Chromatic Number

The Discrete Mathematical Charms of Paul Erdős, 2021

semanticscholar   +2 more sources

The Packing Chromatic Number of the Infinite Square Grid is 15

International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2023
A packing $k$-coloring is a natural variation on the standard notion of graph $k$-coloring, where vertices are assigned numbers from $\{1, \ldots, k\}$, and any two vertices assigned a common color $c \in \{1, \ldots, k\}$ need to be at a distance ...
Bernardo Subercaseaux, Marijn J. H. Heule   +1 more
semanticscholar   +1 more source

Common graphs with arbitrary chromatic number

Compositio Mathematica, 2022
Ramsey’s theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdős conjectured that the random 2-edge-coloring minimizes the number of monochromatic copies of $
D. Král, Jan Volec, F. Wei
semanticscholar   +1 more source