Results 71 to 80 of about 39,087 (298)
Homomorphisms of 2-Edge-Colored Graphs
, 2008 In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs, graphs with bounded maximum average
Sopena, Eric +4 more
core +2 more sources
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
Reconfiguration of list edge-colorings in a graph [PDF]
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ito, Takehiro +2 more
openaire +6 more sources
The Forcing Weak Edge Detour Number of a Graph [PDF]
, 2010 The forcing weak edge detour numbers of certain classes of graphs are ...
Athisayanathan, S., Santhakumaran, A.P.
core +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Twin-width and permutations [PDF]
Logical Methods in Computer ScienceInspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity.
Édouard Bonnet +4 more
doaj +1 more source
Almost eulerian compatible spanning circuits in edge-colored graphs [PDF]
, 2021 Let G be a (not necessarily properly) edge-colored graph. A compatible spanning circuit in G is a closed trail containing all vertices of G in which any two consecutively traversed edges have distinct colors.
Guo, Zhiwei +3 more
core +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source
Relative timing information and orthology in evolutionary scenarios
Algorithms for Molecular Biology, 2023 Background Evolutionary scenarios describing the evolution of a family of genes within a collection of species comprise the mapping of the vertices of a gene tree T to vertices and edges of a species tree S.
David Schaller +5 more
doaj +1 more source
Maximum cuts in edge-colored graphs [PDF]
Discrete Applied Mathematics, 2017 The input of the Maximum Colored Cut problem consists of a graph $G=(V,E)$ with an edge-coloring $c:E\to \{1,2,3,\ldots , p\}$ and a positive integer $k$, and the question is whether $G$ has a nontrivial edge cut using at least $k$ colors. The Colorful Cut problem has the same input but asks for a nontrivial edge cut using all $p$ colors.
Luérbio Faria +4 more
openaire +5 more sources