Results 201 to 210 of about 27,298 (312)

GraphLooper: predicting chromatin loops based on hierarchical multi-view graph pooling method. [PDF]

Brief Bioinform
Wang S, Li Z, Feng H, Cui Z, Guo ZH, Liao Q, Hu Z, Liu W, Zhang Q, Huang DS.   +9 more
europepmc   +1 more source

Towards Characterization of Five‐List‐Colorability of Toroidal Graphs

Journal of Graph Theory, Volume 112, Issue 3, Page 267-275, July 2026.
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, Félix Moreno Peñarrubia   +1 more
wiley   +1 more source

Out-of-distribution generalization enhances protein function annotation for low-homology sequences. [PDF]

Brief Bioinform
Fu Y, Chen J, Lin H, Gu Z, Long Q, Wan H, Luo X, Deng M.   +7 more
europepmc   +1 more source

Visualizing clickstream data with multidimensional scaling

We visualize a a web server log by means of multidimensionalscaling. To that end, a so-called dissimilarity metric is introduced inthe sets of sessions and pages respectively. We interpret the resultingvisualizations and find some interesting patterns.
Azaria, J., Wezel, M.C. van, Pijls, W.H.L.M.   +2 more
core  

Disjoint Total Dominating Sets in Planar Graphs

Journal of Graph Theory, Volume 112, Issue 3, Page 290-295, July 2026.
ABSTRACT The vertex set of any planar graph of minimum degree at least 3 can be colored in two colors so that every vertex has a neighbor of each color. If the graph is a planar triangulation, the coloring can be chosen such that every vertex has a neighbor of its own color and at least two neighbors of the opposite color.
Eva Rotenberg, Daniel Rutschmann, Carsten Thomassen   +2 more
wiley   +1 more source

Image contraction through fuzzy soft outerplanar graph structures. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc   +1 more source

Sensitivity and Hamming Graphs

Journal of Graph Theory, Volume 112, Issue 3, Page 296-305, July 2026.
ABSTRACT For any m ≥ 3 we show that the Hamming graph H ( n , m ) admits an imbalanced partition into m sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the Strong m‐ary Sensitivity Conjecture of Asensio, García‐Marco, and Knauer.
Sara Asensio, Yuval Filmus, Ignacio García‐Marco, Kolja Knauer   +3 more
wiley   +1 more source

Enumeration of Autocatalytic Subsystems in Large Chemical Reaction Networks. [PDF]

J Chem Theory Comput
Golnik R, Gatter T, Stadler PF, Vassena N.   +3 more
europepmc   +1 more source

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

Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.
ABSTRACT We continue the study of ( tw , ω )‐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 Dallard, Milanič, and Štorgel ...
Claire Hilaire, Martin Milanič, Ðorđe Vasić   +2 more
wiley   +1 more source

TAGNN: topology-aware graph neural network framework for link prediction. [PDF]

Sci Rep
Liang M, Zhang H.
europepmc   +1 more source