Results 61 to 70 of about 15,555,412 (284)

The hunting of a snark with total chromatic number 5

, 2014
International audienceA snark is a cyclically-4-edge-connected cubic graph with chromatic index 4. In 1880, Tait proved that the Four-Color Conjecture is equivalent to the statement that every planar bridgeless cubic graph has chromatic index 3.
Dantas, Simone, de Figueiredo, Celina, Preissmann, Myriam, Sasaki, Diana   +3 more
core   +1 more source

Transparent Perovskite Light‐Emitting Diodes with Conductive Oxide Top Electrodes

Advanced Materials, EarlyView.
Transparent perovskite light‐emitting diodes (TrPeLEDs) enable simultaneous display and transparency, expanding application possibilities. Using a metal oxide buffer layer and pulsed laser deposition, TrPeLEDs with diverse compositions and architectures are demonstrated.
Michele Forzatti, Sergio Martínez‐Saiz, Morena Cervino, Edoardo Stanzani, Sandra Jenatsch, Qingsen Zeng, Joo Sung Kim, Dong‐Hyeok Kim, Eojin Yoon, Tae‐Woo Lee, Daniel Tordera, Henk J. Bolink   +11 more
wiley   +1 more source

Hierarchical Flexible Ceramic Nanofiber Membrane for Simultaneous Membrane Distillation and Photocatalytic Hydrogen Evolution

Advanced Materials, EarlyView.
A hierarchical flexible ceramic nanofiber membrane integrates a La‐stabilized ZrO2 scaffold with superhydrophobic UiO‐66‐NH2/CdS heterojunctions. The gas–liquid–solid interfacial architecture sustains vapor‐selective desalination, visible‐light charge separation, and rapid H2 extraction, enabling simultaneous freshwater production and photocatalytic ...
Pengfei Lin, Xiaochen Lu, Jiawei Sun, Shuai Guo, Xinping He, Chunhai Yi, Zhenyao Wang, Jiaxin Guo, Swee Ching Tan, Alicia Kyoungjin An   +9 more
wiley   +1 more source

Colourings of (k-r,k)-trees [PDF]

Opuscula Mathematica, 2017
Trees are generalized to a special kind of higher dimensional complexes known as \((j,k)\)-trees ([L. W. Beineke, R. E. Pippert, On the structure of \((m,n)\)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which
M. Borowiecki, H. P. Patil
doaj   +1 more source

Equitable Total Chromatic Number of Kr×p for p Even

Latin-American Algorithms, Graphs and Optimization Symposium, 2019
A total coloring is equitable if the number of elements colored by any two distinct colors differs by at most one. The equitable total chromatic number of a graph ( χ e ″ ) is the smallest integer for which the graph has an equitable total coloring. Wang
Anderson G. da Silva, S. Dantas, D. Sasaki   +2 more
semanticscholar   +1 more source

Multi‐Biomimetic Structural Colors Inspired by Pearls and Bird Feathers

Advanced Materials, EarlyView.
A dual‐biomimetic strategy mimicking pearls and bird feathers is proposed to construct full‐gamut structural colors. By integrating a non‐strictly periodic inorganic multilayer architecture with tunable light absorbers, this facile approach circumvents the complex fabrication of traditional 1D photonic crystals, offering immense potential for cosmetics,
Zhiwei Wang, Qiuyu Cheng, Qiuyu Jin, Fu Tang, Wenbin Cao, Ayahisa Okawa, Takuya Hasegawa, Takehiro Goto, Natsumi Yamaguchi, Takumi Tanaka, Te‐Wei Chiu, Tohru Sekino, Shu Yin   +12 more
wiley   +1 more source

Effect of Barrel-to-Barrel Variation on Color and Phenolic Composition of a Red Wine

Foods, 2021
Tangible variation of sensory characteristics is often observed in wine aged in similar barrels. Barrel-to-barrel variation in barrel-aged wines was investigated in respect of the most important phenolic compounds of oenological interest.
Leonard Pfahl, Sofia Catarino, Natacha Fontes, António Graça, Jorge Ricardo-da-Silva   +4 more
doaj   +1 more source

Inverse Design of Nanoparticulate Materials

Advanced Materials, EarlyView.
Inverse design shifts nanomaterial development from empirical trial‐and‐error to predictive model‐driven strategies. It can rely on knowledge‐based, data‐based, or hybrid process and property functions. This perspective article provides a practical framework for applying inverse design based on instructive examples. It discusses which modeling approach
Nabi Etienne Traoré, Annika Mauch, Michelle Berthold, Lukas Pflug, Wolfgang Peukert, Nicolas Vogel   +5 more
wiley   +1 more source

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)

Discussiones Mathematicae Graph Theory, 2013
Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj   +1 more source

Neighbor sum distinguishing total chromatic number of 2-degenerate graphs

Discrete Applied Mathematics, 2018
Let G = ( V ( G ) , E ( G ) ) be a graph and ϕ be a proper total k -coloring of G by using the color set { 1 , 2 , … , k } . For any v ∈ V ( G ) , let f ( v ) = ∑ u v ∈ E ( G ) ϕ ( u v ) + ϕ ( v ) . The coloring ϕ is neighbor sum distinguishing, if f ( u
Changqing Xu, Shan Ge, Jianguo Li
semanticscholar   +1 more source