Results 31 to 40 of about 587,547 (217)
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
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
Several results on chordal bipartite graphs [PDF]
, 1997 summary:The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite ...
Bono, Aaron, Bakonyi, Mihály
core +1 more source
Minimum Eccentricity Shortest Paths in some Structured Graph Classes
Journal of Graph Algorithms and Applications, 2016 We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity.
Feodor Dragan, Arne Leitert
doaj +1 more source
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source
The square of a chordal graph [PDF]
, 1994 We introduce the closed-neighborhood intersection multigraph as a useful multigraph version of the square of a graph. We characterize those multigraphs which are squares of chordal graphs and include an algorithm to go from the squared chordal graph back
Harary, Frank, McKee, Terry A.
core +1 more source
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Journal of Graph Algorithms and Applications, 2012 We introduce a notion of simultaneity for any class of graphs with an intersection representation (interval graphs, chordal graphs, etc.) and for comparability graphs, which are represented by transitive orientations.
Krishnam Raju Jampani, Anna Lubiw
doaj +1 more source
Advanced Functional Materials, EarlyView.This study presents a magneto‐mechanical strategy that incorporates FP@MSCs into an aligned PCL/GelMA nerve guidance conduit. Magnetic stimulation increases membrane tension in FP@MSCs, triggering cytoskeletal remodeling, Schwann cell‐like differentiation, and TIMP1 secretion. TIMP1 activates ITGB1/CD63–FAK signaling in NE‐4C cells, increasing membrane
Xinyu Zhu +14 more
wiley +1 more source
Graph Decompositions and Factorizing Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for
Christian Capelle +2 more
doaj +3 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