Results 171 to 180 of about 117,877 (279)

Bio‐inspired nanophotonics: Structural color, chirality, and resonance metasurfaces

open access: yesInfoMat, EarlyView.
A butterfly‐wing‐inspired anisotropic plasmonic flatband resonant metasurface. Insets, photo of the butterfly, Sasakia charonda, and the SEM image of its wing scale (above); the SEM image of the metasurface (below). Abstract The dazzling colors of butterfly wings and hummingbird feathers are not painted with pigments, but crafted by nature's invisible ...
Weihan Liu, Yao Liang, Din Ping Tsai
wiley   +1 more source

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Through computer‐assisted enumeration, we list minimal obstructions for 5‐choosability of graphs on the torus with the following additional property: There exists a cyclic system of non‐contractible triangles around the torus where the consecutive triangles are at distance at most four.
Zdeněk Dvořák   +1 more
wiley   +1 more source

On Strongly and Robustly Critical Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn   +3 more
wiley   +1 more source

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire   +2 more
wiley   +1 more source

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin   +3 more
wiley   +1 more source

Colors for Resources: Reward-Linked Visual Displays in Orchids. [PDF]

open access: yesPlants (Basel)
Coimbra G   +4 more
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Home - About - Disclaimer - Privacy