Results 141 to 150 of about 2,481 (263)
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
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,
Novick, B., Laskar, R.C., Mulder, H.M.
core
Determining what sets of trees can be the clique trees of a chordal graph [PDF]
Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way. In this paper, the following related problem is studied: given a family T of trees,
De Caria, Pablo Jesús +1 more
core
Generative Artificial Intelligence and Large Language Models in Clinical Oncology
By integrating multimodal data, including medical imaging, pathology, omics, and electronic health records, generative AI and LLMs support cancer diagnosis, treatment planning, and follow‐up management. These technologies also enhance physician–patient communication, improve personalized treatment strategies, and leverage intelligent agent automation ...
Yunfang Yu +14 more
wiley +1 more source
Hendry\u27s Conjecture on Chordal Graph Subclasses
A cycle is extendable if there exists another cycle on the same set of vertices plus one more vertex. G.R.T. Hendry conjectured (1990) that every non spanning cycle in a Hamiltonian chordal graph is extendable.
core
ABSTRACT Evidence suggests that the metabolism of inositol and its derivatives may be involved in various biological processes including salt tolerance, but there has been limited understanding. Ectopic expression of Gs5PTase8, an inositol polyphosphate 5‐phosphatase cloned from wild soybean (Glycine soja), significantly enhanced salt tolerance in ...
Qi Jia +12 more
wiley +1 more source
Backbone colouring of chordal graphs
A proper $k$-colouring of a graph $G=(V,E)$ is a function $c: V(G)\to \{1,\ldots,k\}$ such that $c(u)\neq c(v)$ for every edge $uv\in E(G)$. The chromatic number $χ(G)$ is the minimum $k$ such that there exists a proper $k$-colouring of $G$. Given a spanning subgraph $H$ of $G$, a $q$-backbone $k$-colouring of $(G,H)$ is a proper $k$-colouring $c$ of ...
Araújo, Júlio +2 more
openaire +4 more sources
Dual Formulation of the Chordal Graph Conjecture
The idea of an integer linear programming approach to structural learning of decomposable graphical models led to the study of the so-called chordal graph polytope.
Kratochvíl, Václav +2 more
core
Abstract Premise Floral adaptations to pollinators can drive lineage diversification and promote coexistence of species. We investigated the reproductive biology of Satyrium longicolle, a South African orchid that we hypothesized to belong to a long‐proboscid horsefly pollination guild and examined overlap of pollinators and floral traits among ...
Steven D. Johnson +3 more
wiley +1 more source
Characterizations and algorithmic applications of chordal graph embeddings
We introduce the separator graph for a given graph G and show a 1-1 correspondence between its maximal cliques and the minimal triangulations (i.e., ⊆-minimal chordal embeddings) of G.
Scheffler, Petra, Parra, Andreas
core +1 more source
ABSTRACT Objectives Rib cross‐sectional mineralized area provides valuable insights into mechanical loading and bone growth and remodeling. Given the scarcity of Early Pleistocene costal remains in the context of human evolution, we aimed to study the cross‐sectional anatomy of fossil ribs from that period and compare them to a modern human ontogenetic
J. M. López‐Rey +6 more
wiley +1 more source

