Results 101 to 110 of about 11,796 (253)

Pre‐failure behavior of continuous post‐tensioned and post‐grouted beam in case of tendon failure

Structural Concrete, EarlyView.
Abstract Grouted tendons are a common solution for long‐span bridge structures. The grout provides bond and corrosion protection for prestressing steel. However, if the grouting is defective, corrosion of the prestressing steel may initiate and eventually lead to tendon failure.
Olli Asp, Joonas Tulonen, Anssi Laaksonen   +2 more
wiley   +1 more source

Strongly chordal and chordal bipartite graphs are sandwich monotone

Journal of Combinatorial Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, R. Sritharan   +3 more
openaire   +3 more sources

Torpor‐assisted migration: Regular use of shallow torpor reduces rest‐phase energy expenditure for songbirds during migration

Journal of Animal Ecology, EarlyView.
Migrating songbirds regularly use shallow torpor (up to 98% of birds for some species) to save energy (up to 42%) during inactive periods. This Ruby‐crowned Kinglet Corthylio calendula that was captured after a spring snowstorm highlights the value of being able to save energy when encountering unfavourable conditions.
Ryan A. C. Leys, Lily Hou, Liam P. McGuire   +2 more
wiley   +1 more source

Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]

Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Laskar, R.C., Mulder, H.M., Novick, B.
core   +1 more source

Vizing’s conjecture for chordal graphs

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ron Aharoni, Tibor Szabó
openaire   +2 more sources

Volume Quantization with Flexible Singularities for Hexahedral Meshing

Computer Graphics Forum, EarlyView.
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley   +1 more source

Cohen–Macaulay chordal graphs

Journal of Combinatorial Theory, Series A, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jürgen Herzog, Takayuki Hibi, Xinxian Zheng   +2 more
openaire   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Finite groups whose coprime graph is split, threshold, chordal, or a cograph [PDF]

Proceedings of the Estonian Academy of Sciences
Given a finite group G, the coprime graph of G, denoted by Γ(G), is defined as an undirected graph with the vertex set G, and for distinct x, y ∈ G, x is adjacent to y if and only if (o(x), o(y)) = 1, where o(x) and o(y) are the orders of x and y ...
Jin Chen, Shixun Lin, Xuanlong Ma
doaj   +1 more source

Colouring exact distance graphs of chordal graphs

, 2019
For a graph $G=(V,E)$ and positive integer $p$, the exact distance-$p$ graph $G^{[\natural p]}$ is the graph with vertex set $V$ and with an edge between vertices $x$ and $y$ if and only if $x$ and $y$ have distance $p$.
Quiroz, Daniel A.
core