Results 11 to 20 of about 286,443 (288)
Symmetric monochromatic subsets in colorings of the Lobachevsky plane [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Combinatorics
Taras Banakh, Artem Dudko, Dusan Repovs
doaj +1 more source
Restricted color $n$-color compositions [PDF]
Journal of Combinatorics, 2021 Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas for the cases of given allowed colors, given prohibited colors, and colors satisfying modular conditions, we ...
Hopkins, Brian, Wang, Hua
openaire +2 more sources
Graph Colorings and Labelings Having Multiple Restrictive Conditions in Topological Coding
Mathematics, 2022 With the fast development of networks, one has to focus on the security of information running in real networks. A technology that might be able to resist attacks equipped with AI techniques and quantum computers is the so-called topological graphic ...
Xiaohui Zhang +3 more
doaj +1 more source
Metabolites, 2023 This study employed a combination of ultraviolet spectrophotometry, LC-ESI-MS/MS system, and RNA-sequencing technology; the extracts and isolation of total RNA from the red and yellow leaf strains of red maple (Acer rubrum L.) at different developmental ...
Yuanyuan Luo +7 more
doaj +1 more source
On facial unique-maximum (edge-)coloring [PDF]
, 2017 A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna +4 more
core +3 more sources
Complexity of C_k-Coloring in Hereditary Classes of Graphs [PDF]
, 2019 For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f:V(G) -> V(H) such that for every edge uv in E(G) it holds that f(u)f(v)in E(H).
Chudnovsky, Maria +4 more
core +3 more sources
Physical Review E, 2017 A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors using uniform probability $q = 1/n$.
Kundu, Sumanta, Manna, S. S.
openaire +3 more sources
Effects of Color and Glitter on the Removable Space Maintainer [PDF]
Journal of Dental Materials and Techniques, 2020 Introduction: It may be necessary to make some modifications to the removable space maintainers for the persuasion of children to use this device. However, modification of the polymethyl methacrylate (PMMA) may affect its mechanical properties as well ...
Mehmet Unal +3 more
doaj +1 more source
On the fine-grained complexity of rainbow coloring [PDF]
, 2016 The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in $k$ colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors.
Kowalik, Łukasz +2 more
core +3 more sources
Color Vision: Decoding Color Space [PDF]
Current Biology, 2021 A new study has used magnetoencephalography to track cortical responses to color as they emerge in time. Similarities and differences within these neural responses parallel characteristics of the perceptual experience of color.
Retter, Talia, Webster, Michael A.
openaire +3 more sources