Results 21 to 30 of about 60,006 (266)
С высоты птичьего полета. Московские и не только гуаши Евгении Гамбурд (1913–1956)
Искусство Евразии, 2016 Статья посвящена малоизвестному искусству Евгении Гамбурд в области пейзажа. При недолгой жизни, в годы идеологического прессинга, была по достоинству оценена ее работа как мастера сценического костюма, но творчество тонкого пейзажиста жестко ...
Тома, Л.А.
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 Let and be two digraphs; without loops or multiple arcs. An coloring of is a function . We say that is an colored digraph. For an arc of , we say that is the color of over the coloring . A directed path in is an path if is a directed walk in .
Hortensia Galeana-Sánchez +1 more
doaj +1 more source
Colorings of (r, r)-Uniform, Complete, Circular, Mixed Hypergraphs
Mathematics, 2021 In colorings of some block designs, the vertices of blocks can be thought of as hyperedges of a hypergraph H that can be placed on a circle and colored according to some rules that are related to colorings of circular mixed hypergraphs.
Nicholas Newman, Vitaly Voloshin
doaj +1 more source
Frontiers in Plant Science, 2023 Color is an essential appearance characteristic of sweet cherry (Prunus avium L.) fruits and mainly determined by anthocyanin. Temperature plays an important role in the regulation of anthocyanin accumulation.
Yue Tan +6 more
doaj +1 more source
Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs
Discussiones Mathematicae Graph Theory, 2015 Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ (H,G), is the minimum number of colors in an H-free coloring of G.
Kubicka Ewa +2 more
doaj +1 more source
Color Homography Color Correction [PDF]
Color and Imaging Conference, 2016 Accepted by Color Imaging Conference ...
Finlayson, Graham D. +2 more
openaire +2 more sources
Global Dominator Coloring of Graphs
Discussiones Mathematicae Graph Theory, 2019 Let S ⊆ V. A vertex v ∈ V is a dominator of S if v dominates every vertex in S and v is said to be an anti-dominator of S if v dominates none of the vertices of S. Let 𝒞 = (V1, V2, . . ., Vk) be a coloring of G and let v ∈ V (G).
Hamid Ismail Sahul, Rajeswari Malairaj
doaj +1 more source
Vertex Colorings without Rainbow Subgraphs
Discussiones Mathematicae Graph Theory, 2016 Given a coloring of the vertices of a graph G, we say a subgraph is rainbow if its vertices receive distinct colors. For a graph F, we define the F-upper chromatic number of G as the maximum number of colors that can be used to color the vertices of G ...
Goddard Wayne, Xu Honghai
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Survival after relapse in pediatric acute myeloid leukemia (AML) remains poor, highlighting the critical importance of identifying prognostic factors to guide optimal relapse management. Methods We investigated the prognostic impact of multiparameter flow cytometry (MFC) measurable residual disease (MRD) in 188 patients with first ...
Camilla Poulsen +21 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2019 We define an almost-injective coloring as a coloring of the vertices of a graph such that every closed neighborhood has exactly one duplicate. That is, every vertex has either exactly one neighbor with the same color as it, or exactly two neighbors of ...
Goddard Wayne +2 more
doaj +1 more source