Results 41 to 50 of about 235 (177)
The Electronic Journal of CombinatoricsA hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Aristotelis Chaniotis +2 more
openaire +2 more sources
Discrete Mathematics, 1994 The authors characterize those multigraphs which are squares of chordal graphs and develop an algorithm for producing the unique square root from its squared chordal graph.
Frank Harary, Terry A. McKee
openaire +1 more source
The leafage of a chordal graph
Discussiones Mathematicae Graph Theory, 1998 19 pages, 3 ...
In-Jen Lin +2 more
openaire +2 more sources
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +1 more source
Representations of Edge Intersection Graphs of Paths in a Tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic +2 more
doaj +1 more source
Transitivity on Subclasses of Chordal Graphs
, 2023 Let $G=(V, E)$ be a graph, where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$. A vertex partition $π= \{V_1, V_2, \ldots, V_k\}$ of $G$ is called a \emph{transitive $k$-partition} if $V_i ...
Subhabrata Paul, Kamal Santra
openaire +2 more sources
Advanced Healthcare Materials, EarlyView.We developed a patient‐derived, functional microfluidic model of the diffuse midline glioma (DMG) blood–brain–tumor barrier (BBTB) comprised of endothelial cells, astrocytes, pericytes, and tumor cells. The system forms perfusable microvasculature, reveals the BBTB retains vascular integrity, identifies DMG‐specific transcriptomic changes distinct from
Kimberly R. Bennett +7 more
wiley +1 more source
Advanced Science, EarlyView.The pre‐regenerative vascular niche (PVN) is essential for nerve repair, yet its endothelial blueprint remains unclear. We identified angiogenic ECs (AECs) as the dominant pre‐regenerative subset and found that antler blood–derived exosomes (AB‐EXO) promote repair via IMP3.
Jinsheng Huang +11 more
wiley +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
Advanced Science, EarlyView.CHCHD10 loss in Alzheimer's disease is associated with mitochondrial dysfunction, epigenomic disruption, and tau pathology. Restoration of CHCHD10 shifts DNA methylation toward a non‐disease state and reduces tau and amyloid pathology, with KATNAL2 acting as a downstream effector.
Teresa M. Thomas +13 more
wiley +1 more source