Results 221 to 230 of about 9,430 (262)

Exploring oxide quasicrystals in internal space. [PDF]

Acta Crystallogr A Found Adv
Schenk S, Haller M, Förster S, Widdra W.   +3 more
europepmc   +1 more source

Introduction to the CLEM technique developed in the field of neuroanatomy. [PDF]

Anat Sci Int
Fukuda T.
europepmc   +1 more source

On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers. [PDF]

Ann Comb
Axenovich M, Martin RR, Winter C.
europepmc   +1 more source

Interplay between Cation "Coloring" and Stereochemically Active Lone Pairs in AgBiS₂ Thin Films. [PDF]

Inorg Chem
Koskela KM, Pakhira A, Strumolo MJ, Banerjee S, Brutchey RL.   +4 more
europepmc   +1 more source

Restless reachability problems in temporal graphs. [PDF]

Knowl Inf Syst
Thejaswi S, Lauri J, Gionis A.
europepmc   +1 more source

Comparative evaluation of aqueous Beta vulgaris extract as a natural microbial dye relative to standard stains through image processing. [PDF]

Sci Rep
Gouda S, Shetty N, Arundathi HA, Venkatesh VN, Mohan S, Dinesha P.   +5 more
europepmc   +1 more source

A technique to create hydrogels with tethered concentration gradients of molecules <i>in vitro</i>.

Soft Matter
O'Shea TC, Salem A, Schultz KM.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The NP-Completeness of Edge-Coloring

SIAM Journal on Computing, 1981
We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs.
exaly   +3 more sources

Extending an edge‐coloring

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.
Odile Marcotte, Paul D. Seymour
openaire   +1 more source