Results 231 to 240 of about 92,019 (279)
Advanced Functional Materials, EarlyView.In this study, the interplay of dipolar dynamics and ionic charge transport in MOF compounds is investigated. Synthesizing the novel structure CFA‐25 with integrated freely rotating dipolar groups, local and macroscopic effects, including interactions with Cs cations are explored.
Ralph Freund +6 more
wiley +1 more source
Non-iridescent yet angle-dependent structural colors on titanium surfaces induced by laser oxidation. [PDF]
NanophotonicsYu X +6 more
europepmc +1 more source
The growth rate of multicolor Ramsey numbers of 3-graphs. [PDF]
Res Math SciBradač D, Fox J, Sudakov B.
europepmc +1 more source
Quality detection and grading of peach fruit based on image processing method and neural networks in agricultural industry. [PDF]
Front Plant SciLuo D, Luo R, Cheng J, Liu X.
europepmc +1 more source
An efficient swarm evolution algorithm with probability learning for the black and white coloring problem. [PDF]
Sci RepZhang Z, Zhang L, Zhang X.
europepmc +1 more source
Knot theory and error-correcting codes. [PDF]
Des Codes CryptogrKılıç AB +3 more
europepmc +1 more source
krepp: a k-mer-based maximum pseudo-likelihood method for estimating read distances and genome-wide phylogenetic placement. [PDF]
Genome BiolŞapcı AOB, Mirarab S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1987
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Hanson, D., Toft, B.
openaire +1 more source
AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t.
Hanson, D., Toft, B.
openaire +1 more source
Journal of Graph Theory, 1990
AbstractWhen can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching.
Marcotte, O., Seymour, P. D.
openaire +1 more source
AbstractWhen can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching.
Marcotte, O., Seymour, P. D.
openaire +1 more source