Results 91 to 100 of about 973,826 (351)
Advanced Functional Materials, EarlyView.Hydrophilic PEO‐copolymers and hydrophobic PDMS are physically integrated via a compatibilizing solvent into an amphipathic dual‐polymer network with versatile interfacial affinity and completely amorphized PEO segments for hyper‐permeable CO2 transport.
Ji Wu +9 more
wiley +1 more source
Contractions in perfect graph [PDF]
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set.
Fouilhoux, Pierre +3 more
core +1 more source
Coloring of graph of ring with respect to idempotents [PDF]
Mathematica BohemicaLet $R$ be a ring with nonzero identity. A graph $G_{{\rm Id}}(R)$ of $R$ with respect to idempotents of $R$ has elements of $R$ as vertices and distinct vertices $x$, $y$ are adjacent if and only if $x + y$ is an idempotent of $R$.
Avinash Patil, Dipika Patil
doaj +1 more source
Compositions for perfect graphs
Discrete Mathematics, 1985 In this paper we introduce a new graph composition, called 2-amalgam, and we prove that the 2-amalgam of perfect graphs is perfect. This composition generalizes many of the operations known to preserve perfection, such as the clique identification, substitution, join and amalgam operations.
Gérard Cornuéjols +1 more
openaire +2 more sources
A New Bioactive Glass‐Based Hybrid Bioink With Enhanced Cell Viability and Antibacterial Properties
Advanced Healthcare Materials, EarlyView.Graphical illustration of the production and characterization process, demonstrating the multiple functions of the new hybrid gelatin methacryloyl‐silver‐bioactive glass (GAB) material. Created in https://BioRender.com. ABSTRACT Recent advances in three‐dimensional bioprinting (3DBP) technology enable the production of customized bone substitutes ...
Adam C. Marsh +14 more
wiley +1 more source
Covering a cubic graph with perfect matchings
, 2013 Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them.
Mazzuoccolo, Giuseppe
core +2 more sources
Approximating Maximum Edge 2-Coloring by Normalizing Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors.
Tobias Mömke +4 more
doaj +1 more source
Perfect Circle's Plant in Richmond, Indiana
, 1940 Luvena Dethridge sang in concerts while holding various jobs. After working at Reid Memorial Hospital as a cook, laundress, and maid, she worked as a piston inspector for the Perfect Circle plant in Richmond in the 1940s. A contract for a concert in 1945
Perfect Circle Company
core
Advanced Healthcare Materials, EarlyView.Engineered red blood cell‐derived extracellular vesicles (eRBCEVs) are synthesized via controlled microfluidic assembly from native RBC lipids, enabling tunable encapsulation of proteins, nucleic acids, nanoparticles, and viral vectors. The platform demonstrates reproducible nanoscale architecture, preserved membrane composition, and functional cargo ...
Chiranth K. Nagaraj +23 more
wiley +1 more source
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
Zhejiang Daxue xuebao. Lixue ban, 2009 Let G be a connected graph containing a perfect matching. G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. The main result is as follows: Halin graph
HUIZhi-hao(惠志昊), ZHAOBiao(赵飚)
doaj +1 more source