Results 131 to 140 of about 978,529 (303)
THE LOCATING RAINBOW EDGE CONNECTION NUMBERS OF SOME GENERALIZED SUN GRAPHS
BarekengThroughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to ...
Muhammad Ahnaf Yusuf +2 more
doaj +1 more source
Edge-Coloring and f-Coloring for Various Classes of Graphs
, 1999 In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f-coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v.
Xiao Zhou, Takao Nishizeki
core
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
, 2011 Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core
Mutant p53R273H disrupts PDPK1 homodimerization and contributes to PDPK1 activation
Molecular Oncology, EarlyView.How mutant p53R273H drives AKT signaling is unclear. We show that p53R273H, but not wild‐type, directly binds PDPK1 via a mutation‐dependent conformational change. This interaction disrupts inhibitory PDPK1 homodimerization and enhances AKT phosphorylation.
Mei Chee Lim +11 more
wiley +1 more source
Molecular Oncology, EarlyView.LVRF (lymphatic and vascular resistance factor) is a VEGFA splice variant upregulated in response to anti‐angiogenic therapy that fosters tumor adaptation through enhanced vascularization, lymphangiogenesis, and metastatic dissemination. Targeting LVRF with fully human neutralizing antibodies disrupts these processes and limits resistant tumor growth ...
Marion David +12 more
wiley +1 more source
Edge coloring total k-labeling of Generalized Peterson Graphs
, 2013 International audienceThe Edge-coloring total k-labeling of a connected graph G is an assignmentf of non negative integers to the vertices and edges of G such thattwo adjacent edges uv and uv′ of G have different weights.
Kheddouci, Hamamache +2 more
core +2 more sources
The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
Journal of Graph Algorithms and ApplicationsA $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to ...
Vahan Mkrtchyan
doaj +1 more source
Molecular Oncology, EarlyView.This paper shows that size‐exclusion chromatography and sequential centrifugation applied to seminal plasma enrich for different populations of extracellular vesicles. This may significantly affect the detection and analysis of extracellular vesicle‐associated cancer biomarkers.
Elen Telumyan +8 more
wiley +1 more source
Approximation Algorithms for Distance-2 Edge Coloring [PDF]
, 2002 The authors consider the link scheduling problem for packet radio networks which is assigning channels to the connecting links so that transmission may proceed on all links assigned the same channel simultaneously without collisions.
Marathe, Madhav +4 more
core
Arboricity-Dependent Algorithms for Edge Coloring [PDF]
The problem of edge coloring has been extensively studied over the years. Recently, this problem has received significant attention in the dynamic setting, where we are given a dynamic graph evolving via a sequence of edge insertions and deletions and ...
Costa, Martín +3 more
core +1 more source