Results 131 to 140 of about 96,090 (258)

Long‐Term Metabolic Outcomes Following Bariatric Surgery: A Systematic Review, Meta‐Analysis, and Meta‐Regression

Obesity Reviews, EarlyView.
ABSTRACT Bariatric surgery (BS) has short‐ and medium‐term benefits in improving metabolic syndrome (MetS) components, but its long‐term impact remains incompletely characterized. This systematic review and meta‐analysis aimed to quantify the long‐term effects of BS (≥ 5 years) on fasting blood glucose (FBG), HDL cholesterol, triglycerides (TG), waist ...
Bernardo Paz Barboza, Pietro Ferrara, Lisa Ye, Lorenzo Losa, Gianluca Perseghin, Giovanni Cesana, Paolo Berta, Lorenzo Giovanni Mantovani   +7 more
wiley   +1 more source

Systematic Review of Parasite Diversity in Wild Freshwater Fishes and Their Host‐Locality Interactions in Türkiye

Zoologica Scripta, EarlyView.
ABSTRACT This systematic review documented a taxonomically diverse parasite fauna of freshwater fishes across seven geographical regions of Türkiye, encompassing 11 phyla: Acanthocephala, Annelida, Arthropoda, Choanozoa, Ciliophora, Cnidaria, Euglenozoa, Mollusca, Myzozoa, Nematoda, and Platyhelminthes.
Canan Hamurkaroğlu, Ahmet Özer, Nazan Danacıoğlu, Ayten Yiğiter   +3 more
wiley   +1 more source

P2p-factorization of a complete bipartite graph

Discrete Mathematics, 1993
Given a graph \(G\), every spanning subgraph with all its components isomorphic to the \(2k\)-vertex path is called a \(P_{2k}\)-factor of \(G\), for a fixed integer \(k\geq 1\). It is shown that the complete bipartite graph \(K_{n,m}\) is the edge-disjoint union of \(P_{2k}\)-factors if and only if \(m=n\) and \(m\equiv 0\mod{k(2k-1)}\).
openaire   +1 more source

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Hitting Times in the Binomial Random Graph

Journal of Graph Theory, Volume 113, Issue 2, Page 377-393, October 2026.
ABSTRACT Fix k ≥ 2 , choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) Bertille Granet, Felix Joos, Jonathan Schrodt   +2 more
wiley   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Sharp Choice Number Thresholds for Complete Bipartite Graphs

Axioms
Fix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold ...
Julian Allagan, Benkam Bobga, Jianning Su, Weizheng Gao, Shanzhen Gao   +4 more
doaj   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, Volume 113, Issue 1, Page 38-56, September 2026.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, Volume 113, Issue 1, Page 5-18, September 2026.
ABSTRACT A balanced ( p , q )‐coloring of a signed graph ( G , σ ) is an assignment of q colors to each vertex of G from a platter of p colors, such that each color class induces a balanced set (a set that does not induce a negative cycle). The fractional balanced chromatic number of ( G , σ ), denoted χ f b ( G , σ ), is the minimum ratio p / q such ...
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source

Fractional List Packing for Layered Graphs

Journal of Graph Theory, Volume 113, Issue 1, Page 19-37, September 2026.
ABSTRACT The fractional list packing number χ ℓ • ( G ) of a graph G is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N need to be to ensure the existence of a “perfectly balanced” probability distribution on proper L‐colourings, that is, such ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source