Results 131 to 140 of about 159,249 (195)
Synthesis and perfection evaluation of NaA zeolite membrane
Separation and Purification Technology, 2001 The synthesis of NaA zeolite membrane on a porous alpha -Al2O3 support from clear solution and the evaluation of the perfection of the as-synthesized membrane by gas permeation were investigated.
Weishen Yang, Xiaochun Xu, Liwu Lin
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Novum Testamentum, 2015
Hebrews evinces the linked exegetical aporiae of, on the one hand, tension between the asserted perfection of the believer and exhortations to further perfection and, on the other, a similar tension between Christ's exalted, preexistent nature and claims about his need for further perfection during his earthly life.
openaire +2 more sources
Hebrews evinces the linked exegetical aporiae of, on the one hand, tension between the asserted perfection of the believer and exhortations to further perfection and, on the other, a similar tension between Christ's exalted, preexistent nature and claims about his need for further perfection during his earthly life.
openaire +2 more sources
Perfect and Deficient Perfect Numbers
The American Mathematical Monthly, 2019For n a positive integer, let σ(n) denote the sum of the divisors of n. The number n is said to be deficient perfect if σ(n)/n=(2x−1)/x for some x∈N .
Rachfal, Emily, Holdener, Judy
openaire +2 more sources
The quest for the perfect perfect-maze
2015 Computer Games: AI, Animation, Mobile, Multimedia, Educational and Serious Games (CGAMES), 2015In this paper, the quest for the perfect perfect-maze is performed over the search space of perfect mazes using an approach of search-based procedural content generation. Perfect maze construction is rather random with little to no control of the final product.
Paul Hyunjin Kim, Roger Crawfis
openaire +1 more source
Journal of Graph Theory, 2014
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres +1 more
openaire +3 more sources
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Stephan Dominique Andres +1 more
openaire +3 more sources
Perfect and locally perfect colorings
Journal of Graph Theory, 1995AbstractWe present a new algorithm for coloring perfect graphs and use it to color the parity orderable graphs, a class which strictly contains parity graphs. Also, we modify this algorithm to obtain an O(m2 + n) locally perfect coloring algorithm for parity graphs. © 1995 John Wiley & Sons, Inc.
openaire +2 more sources
Cycle-perfect graphs are perfect
Journal of Graph Theory, 1996Given any graph \(G\), the cycle graph \(C(G)\) of \(G\) is defined by letting the vertices of \(C(G)\) be the induced cycles of \(G\); two induced cycles of \(G\) are adjacent in \(C(G)\) if they have in \(G\) at least one edge in common. \(G\) is called cycle-perfect if \(G\) and \(C(G)\) have no chordless cycles of odd length at least five.
openaire +3 more sources
The Ethics of Sports Technologies and Human Enhancement, 2007
reakthroughs in genetics present us with a promise and a predicament. The promise is that we may soon be able to treat and prevent a host of debilitating diseases.
Michael J. Sandel
semanticscholar +1 more source
reakthroughs in genetics present us with a promise and a predicament. The promise is that we may soon be able to treat and prevent a host of debilitating diseases.
Michael J. Sandel
semanticscholar +1 more source