Results 81 to 90 of about 10,361 (216)
iMetaOmics, EarlyView.This schematic illustrates how probiotics‐derived postbiotics (PLBK®1–5) combat high‐fat diet‐induced obesity. Postbiotics remodel gut microbiota, boosting beneficial metabolites. These metabolites activate adipocyte thermogenesis (Ucp1/AMPK pathway), resulting in reduced body weight, improved insulin sensitivity, and alleviated hepatic steatosis in ...
Ye Tian +7 more
wiley +1 more source
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
Discrete Mathematics, 2003 This paper studies dual-chordal graphs, that is, graphs that are dual to chordal graphs with regard to cycle/cutset duality. A characteristic of such graphs is that every cutset with at least four edges is accompanied by a certain kind of edge, a ``cut-chord.'' One result allows us to recognize dual-chordal graphs by simply looking at cubic graphs.
openaire +1 more source
Generating Weakly Chordal Graphs from Arbitrary Graphs
, 2022 We propose a scheme for generating a weakly chordal graph from a randomly generated input graph, G = (V, E). We reduce G to a chordal graph H by adding fill-edges, using the minimum vertex degree heuristic. Since H is necessarily a weakly chordal graph, we use an algorithm for deleting edges from a weakly chordal graph that preserves the weak ...
Khanduja, Sudiksha +3 more
openaire +2 more sources
Towards Characterization of Five‐List‐Colorability of Toroidal Graphs
Journal of Graph Theory, EarlyView.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 +1 more
wiley +1 more source
Clique roots of K4-free chordal graphs
Electronic Journal of Graph Theory and Applications, 2019 The clique polynomial C(G, x) of a finite, simple and undirected graph G = (V, E) is defined as the ordinary generating function of the number of complete subgraphs of G. A real root of C(G, x) is called a clique root of the graph G.
Hossein Teimoori Faal
doaj +1 more source
3-Colourability of Dually Chordal Graphs in Linear Time [PDF]
, 2012 A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs.
Leitert, Arne
core
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Chordal Completions of Planar Graphs
Journal of Combinatorial Theory, Series B, 1994 A graph is chordal if there are no induced cycles of length 4 or more. A chordal completion of a graph is formed by adding edges until the resulting graph is chordal. What is the minimal number of edges in a chordal completion? The authors answer this question for the class of planar graphs: every planar graph on \(n\) vertices has a chordal completion
Chung, F.R.K., Mumford, D.
openaire +2 more sources
PLANTS, PEOPLE, PLANET, EarlyView.Arboreta bridge people and nature while conserving tree biodiversity, supporting climate resilience, and advancing environmental education. This study maps over a century of available and indexed arboretum research, uncovering trends, knowledge gaps, and opportunities for collaboration.
Catarina Patoilo Teixeira +1 more
wiley +1 more source