Results 91 to 100 of about 213,457 (302)

Interval Vertex-Coloring of a Graph With Forbidden Colors

Discrete Mathematics, 1989
The classical model of coloring the vertices of a graph with single colors so that no two adjacent vertices are colored the same is too limited to be useful in many practical applications. Therefore one must consider more general notions of graph coloring and this article is devoted to one of such generalizations.
openaire   +2 more sources

POSS‐PEG‐NHS and GSH Cocrosslink DPAV to Prepare Anticalcification Bioprosthetic Scaffold With Enhanced Reendothelization, Anti‐inflammation, and Anti‐ROS

Advanced Healthcare Materials, EarlyView.
POSS‐PEG‐NHS and GSH cocrosslinked DPAV to prepare a multifunctional anticalcification valve substitute. This modification enhances mechanical properties, hemocompatibility, and re‐endothelialization while promoting anti‐inflammatory M2 macrophage infiltration and reducing calcification.
Yuqing Zhang, Chen Qian, Yingjie He, Jingli Ding, Binhao Zhang, Minghui Zou, Xing Chen, Jinping Zhao, Cuifen Lu, Jinping Liu, Jianliang Zhou   +10 more
wiley   +1 more source

A Modular Liver–Microbial Microfluidic Platform to Evaluate Therapeutic and Adverse Effects of Microbial Metabolites

Advanced Healthcare Materials, EarlyView.
This study introduces a modular microfluidic platform that connects liver cells with live microbes to mimic key aspects of the gut–liver interaction in steatosis. Using this system, both microbial metabolites and live bacteria significantly reduced fat accumulation in liver cells, but live microbes triggered inflammation and broader metabolic changes ...
Hsih‐Yin Tan, In Young Hwang, Nanthini Jayabalan, Hui Ling Lee, Louis Jun Ye Ong, Chwee Teck Lim, Matthew Wook Chang, Yi‐Chin Toh   +7 more
wiley   +1 more source

Twin edge colorings of certain square graphs and product graphs

Electronic Journal of Graph Theory and Applications, 2016
A twin edge $k\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\mathbb{Z}_k$ of the colors of the edges ...
R Rajarajachozhan, R. Sampathkumar
doaj   +1 more source

Multifunctional Thiolated Hyaluronic Acid‐graft‐PEDOT Dressing With Antifouling, On‐Demand Drug Delivery and Electrical Stimulation for Wound Healing

Advanced Healthcare Materials, EarlyView.
A multifunctional P(EDOT‐co‐EDOT‐g‐THA) dressing acts as a dynamic biointerface integrating antifouling capability, on‐demand drug delivery, and electrical stimulation. It achieves electrochemically triggered thiolated hyaluronic acid (THA) release while modulating cellular responses for wound healing application.
Jingwen Yang, Jiwon Hong, Anthony Phillips, Bicheng Zhu, Jenny Malmstrom, Devon T. Bryant, Alireza Akbarinejad, Lisa I. Pilkington, Jadranka Travas‐Sejdic   +8 more
wiley   +1 more source

Ferroelectric Quantum Dots for Retinomorphic In‐Sensor Computing

Advanced Materials, EarlyView.
This work has provided a protocol for fabricating retinomorphic phototransistors by integrating ferroelectric ligands with quantum dots. The resulting device combines ferroelectricity, optical responsiveness, and low‐power operation to enable adaptive signal amplification and high recognition accuracy under low‐light conditions, while supporting ...
Tingyu Long, Huanyu Zhou, Jaewan Ko, Hongwei Tan, Jaemin Lim, Yanfei Zhao, Daehan Kang, Eojin Yoon, Gyeong‐Tak Go, Somin Kim, Seung‐Woo Lee, Chan‐Yul Park, Hyojun Choi, Hyeran Kim, Hyung Joong Yun, Sung Hyuk Park, Kwan Sik Park, Jeong Woo Park, Mungeun Kim, Yong Soo Cho, Ho Won Jang, Wenqiang Yang, Min Hyuk Park, Wan Ki Bae, Sebastiaan van Dijken, Joona Bang, Tae‐Woo Lee   +26 more
wiley   +1 more source

An exact approach for the Vertex Coloring Problem

Discrete Optimization, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MALAGUTI, ENRICO, MONACI, MICHELE, TOTH, PAOLO   +2 more
openaire   +3 more sources

Some Equal Degree Graph Edge Chromatic Number

MATEC Web of Conferences, 2016
Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun, Ren Zhi Guo, Yue Qiu Ju, Feng Zhong Yi, Lan Cai Hui   +4 more
doaj   +1 more source

Kelvin Probe Force Microscopy in Bionanotechnology: Current Advances and Future Perspectives

Advanced Materials, EarlyView.
Kelvin probe force microscopy (KPFM) enables the nanoscale mapping of electrostatic surface potentials. While widely applied in materials science, its use in biological systems remains emerging. This review presents recent advances in KPFM applied to biological samples and provides a critical perspective on current limitations and future directions for
Ehsan Rahimi, Mario Palacios‐Corella, Arjan Mol, Salvador Pané, Josep Puigmartí‐Luis   +4 more
wiley   +1 more source

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types [PDF]

Computer Science Journal of Moldova, 2003
We consider the coloring of edges in a graph in which there are vertices of three types. In a feasible edge coloring, each vertex of the first type is incident with at least two edges of the same color, and each vertex of the second type with at least ...
Zsolt Tuza, Vitaly Voloshin
doaj