Results 61 to 70 of about 11,475 (265)
Interdisciplinary Medicine, EarlyView.This study develops a novel miRNA‐based framework for estimating the time since deposition of semen stains, combining small RNA sequencing with machine learning. Time‐dependent miRNA modules were identified using Mfuzz clustering and WGCNA, followed by a multi‐stage feature selection pipeline that reduced 261 candidate miRNAs to a minimal 7‐miRNA panel.
Meiming Cai +11 more
wiley +1 more source
On clique numbers of colored mixed graphs
Discrete Applied Mathematics, 2023 An (m,n)-colored mixed graph, or simply, an (m,n)-graph is a graph having m different types of arcs and n different types of edges. A homomorphism of an (m,n)-graph G to another (m,n)-graph H is a vertex mapping that preserves adjacency, the type thereto and the direction.
Chakraborty, Dipayan +4 more
openaire +2 more sources
Journal of Adolescence, EarlyView.ABSTRACT Introduction Adolescence is a period of heightened vulnerability to psychopathology, when capacities for mentalising and interpersonal trust develop rapidly. This study investigated how configurations of reflective functioning (RF) and epistemic trust (ET) differentiate patterns of internalizing and externalizing problems in youth.
Ilaria Maria Antonietta Benzi +5 more
wiley +1 more source
Lower Bounds for the Graph Homomorphism Problem
, 2015 The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$.
A Björklund +19 more
core +1 more source
Rainbow cliques in edge-colored graphs
European Journal of Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Chuandong +3 more
openaire +2 more sources
Analogues of Cliques for (m, n)-Colored Mixed Graphs [PDF]
Graphs and Combinatorics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien +2 more
openaire +2 more sources
On Strongly and Robustly Critical Graphs
Journal 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
Coloring the cliques of line graphs
Discrete Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gábor Bacsó +2 more
openaire +3 more sources
Clique coloring of binomial random graphs [PDF]
Random Structures & Algorithms, 2018 A clique coloring of a graph is a coloring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colors in such a coloring is the clique chromatic number. In this paper, we study the asymptotic behavior of the clique chromatic number of the random graph 𝒢(n,p) for a wide range of edge ...
McDiarmid, C, Mitsche, D, Pralat, P
openaire +4 more sources
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal 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