Results 101 to 110 of about 12,385 (266)
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
Fan R. K. Chung, David Mumford
openaire +2 more sources
Early use of the reinforced concrete in the architecture of the Historicism in Austria–Hungary
Structural Concrete, EarlyView.Abstract The study examines the early incorporation of reinforced concrete in the architecture of Historicism in Austria–Hungary. Spanning the late 19th to early 20th centuries, the research illuminates the period's stylistic pluralism and the transformative impact of reinforced concrete.
Éva Lovra, Zoltán Bereczki
wiley +1 more source
Clique trees of infinite locally finite chordal graphs [PDF]
, 2018 We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core +1 more source
Large‐scale tests of 50‐year‐old prestressed concrete bridge girders
Structural Concrete, EarlyView.Abstract An experimental investigation has been carried out as part of the BRIDGE|50 research project, focusing on large‐scale loading tests performed on five 50‐year‐old prestressed concrete (PC) girders. The study aimed at evaluating the structural response of five girders retrieved from a viaduct in the urban area of Turin, Italy, subjected to 4 ...
Francesco Tondolo +7 more
wiley +1 more source
The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs [PDF]
, 2022 Grant Fickes, Tony W. H. Wong
openalex +1 more source
Structural Concrete, EarlyView.Abstract Compression field approaches such as the Cracked Membrane Model with fixed, interlocked cracks (CMM‐F) are efficient tools for the mechanical modeling of reinforced concrete elements, providing the mechanical model σ=fε$$ \boldsymbol{\upsigma} =f\left(\boldsymbol{\upvarepsilon} \right) $$ required for finite element analyses.
Andreas Näsbom +2 more
wiley +1 more source
On some special classes of contact $B_0$-VPG graphs
, 2019 A graph $G$ is a $B_0$-VPG graph if one can associate a path on a rectangular grid with each vertex such that two vertices are adjacent if and only if the corresponding paths intersect at at least one grid-point.
Bonomo-Braberman, Flavia +3 more
core
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 +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
Integer Laplacian eigenvalues of strictly chordal graphs [PDF]
, 2020 Nair Maria Maia de Abreu +2 more
openalex +1 more source