Results 71 to 80 of about 11,796 (253)
On the pathwidth of chordal graphs
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Intersection Graphs of Pseudosegments: Chordal Graphs
Journal of Graph Algorithms and Applications, 2010 We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability.
Cornelia Dangelmayr +2 more
openaire +3 more sources
Finite Element Modelling of Rocking and Hybrid Precast Walls under Seismic Loading
Earthquake Engineering &Structural Dynamics, EarlyView.ABSTRACT In recent years, self‐centring systems have received considerable research interest in the seismic design of precast concrete structures for their ability to limit damage and satisfy resilience requirements. Rocking and hybrid structural walls, characterised by the formation of a single gap at the wall–foundation interface, mitigate damage by ...
Andrea Belleri +3 more
wiley +1 more source
Interdisciplinary Materials, EarlyView.The distributed multijoint motion recognition cluster based on polyvinylidene fluoride membranes with high piezoelectric properties adopted a one‐master‐multiple‐slaves architecture and multipoint wireless collaboration to synchronously recognize motions of the wrist, elbow, and shoulder.
Zhongkun Wang +8 more
wiley +1 more source
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
On rank-width of even-hole-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We present a class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width. In general, even-hole-free graphs have unbounded rank-width, because chordal graphs are even-hole-free. A.A. da Silva, A. Silva and C.
Isolde Adler +5 more
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
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
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 Applied Mathematics, 2002 A chordally signed graph is defined as a signed chordal graph (each edge is designated as being positive or negative and every induced cycle is a triangle) in which every cycle \(C\) containing an even number of negative edges (positive cycles) has a chord \(e\) such that \(C\cup\{e\}\) forms two positive cycles.
openaire +1 more source