Results 51 to 60 of about 39,087 (298)
Sufficient conditions for properly colored C3’s and C4’s in edge-colored complete graphs [PDF]
, 2023 For an edge-colored graph, its minimum color degree is the minimum number of distinct colors appearing on the edges incident with a vertex, and its maximum monochromatic degree is the maximum number of edges with the same color incident with a vertex.
Broersma, Hajo; id_orcid +4 more
core +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source
On the complexity of edge-colored subgraph partitioning problems in network optimization [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network ...
Xiaoyan Zhang +3 more
doaj +1 more source
Maximum colored trees in edge-colored graphs
, 2019 International audienceWe consider maximum properly edge-colored trees in edge-colored graphs. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly
Fernandez de La Vega, Wenceslas +13 more
core +1 more source
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
Cycle extension in edge-colored complete graphs [PDF]
, 2017 Let G be an edge-colored graph. The minimum color degree of G is the minimum number of different colors appearing on the edges incident with the vertices of G.
Chuandong Xu +8 more
core +1 more source
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
On the Adjacent Strong Equitable Edge Coloring of Pn ∨ Pn, Pn ∨ Cn and Cn ∨ Cn
MATEC Web of Conferences, 2016 A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different,and the number of edges in any two color classes differ by at most one,which the required ...
Liu Jun +4 more
doaj +1 more source
The Parameterized Complexity of the Rainbow Subgraph Problem
Algorithms, 2015 The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner +3 more
doaj +1 more source
On restricted colorings of (d,s)-edge colorable graphs
, 2020 A cycle is 2-colored if its edges are properly colored by two distinct colors. A (d, s)-edge colorable graphG is a d-regular graph that admits a proper d-edge coloring in which every edge of G is in at least s−1 2-colored 4-cycles.
Pham, Lan Anh,
core +1 more source