Results 121 to 130 of about 641,529 (298)

Parsimonious edge-coloring on surfaces

Electronic Journal of Graph Theory and Applications, 2018
We correct a small error in a 1996 paper of Albertson and Haas, and extend their lower bound for the fraction of properly colorable edges of planar subcubic graphs that are simple, connected, bridgeless, and edge-maximal to other surface embeddings of ...
Sarah-Marie Belcastro
doaj   +1 more source

On restricted edge-colorings of bicliques

Discrete Mathematics, 2002
For graphs \(G\) and \(H\) and integers \(q \leq q'\), an \((H; q, q')\)-coloring of \(G\) is an edge coloring of \(G\) such that every copy of \(H\) in \(G\) receives at least \(q\) colors and at most \(q'\) colors. The maximum number and minimum number of colors in an \((H; q, q')\)-coloring of \(G\) is denoted by \(r(G, H: q, q')\) and \(R(G, H: q ...
Dhruv Mubayi, Douglas B. West
openaire   +1 more source

CEACAM1 participation in breast cancer progression

Molecular Oncology, EarlyView.
In invasive breast cancer (BC), CEACAM1 shifts from an apical to a uniform membranous/cytoplasmic pattern, or is lost, as tumors dedifferentiate, inversely tracking the Ki‐67 proliferative index. In MCF‐7 cells, only CEACAM1‐4L suppresses proliferation, repressing cell cycle and growth factor genes.
Mykola Lyndin, Irina Kube‐Golovin, Anatolii Romaniuk, Gunther Wennemuth   +3 more
wiley   +1 more source

Acyclic edge coloring of graphs [PDF]

, 2013
An {\em acyclic edge coloring} of a graph $G$ is a proper edge coloring such that the subgraph induced by any two color classes is a linear forest (an acyclic graph with maximum degree at most two). The {\em acyclic chromatic index} $\chiup_{a}'(G)$ of a
Tao Wang, Yaqiong Zhang, Wang, Tao, Zhang, Yaqiong   +3 more
core   +2 more sources

Pharmacological chromatin remodeling enhances response to estrogen therapy in ER+ breast cancer

Molecular Oncology, EarlyView.
Estrogen therapy elicits clinical benefit in ~ 30% of patients with endocrine‐resistant estrogen receptor (ER)‐positive breast cancer. Based on findings that ER transcriptional activation underlies response to estrogen therapy, we tested the effects of epigenetic dysregulation via pharmacological inhibition of histone deacetylases (HDACi).
Anneka L. Johnson Thomas, Barbara Karakyriakou, Patricia C. Muskus, Alyssa M. Roberts, Justin Rendleman, Alexa Warren, Hanxu Lu, Kimberly A. Birmingham, Malone K. Friedman, Abigail E. Goen, Huijuan Yang, Owen M. Wilkins, Fred W. Kolling, Eugene Demidenko, Julie M. Jorns, Brock C. Christensen, Todd W. Miller   +16 more
wiley   +1 more source

Monotonic Stable Solutions for Minimum Coloring Games [PDF]

For the class of minimum coloring games (introduced by Deng et al. (1999)) we investigate the existence of population monotonic allocation schemes (introduced by Sprumont (1990)).
Miquel, S., Norde, H.W., Hamers, H.J.M.
core   +1 more source

IMPLEMENTASI ALGORITMA GREEDY UNTUK MELAKUKAN GRAPH COLORING: STUDI KASUS PETA PROPINSI JAWA TIMUR

Jurnal Informatika, 2010
This paper will describe us how to coloring a graph by using greedy algorithm with the case study province of Jawa Timur. From this research we will know that for graph coloring at Jawa Timur Province only use four difference colors.
Ardiansyah Ardiansyah, Fery Sofian Efendi, Syaifullah Syaifullah, Mateus Pinto, Pujianto Pujianto, Hendro Steven Tempake   +5 more
doaj   +1 more source

Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae

FEBS Open Bio, EarlyView.
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj, Eline M. F. de Lange, Klaas A. Sjollema, Ben N. G. Giepmans   +3 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, Barrett, Christopher L., Istrate, Gabriel, Vilikanti, Anil Kumar, Thite, Shripad V.   +4 more
core  

Approximating the max-edge-coloring problem [PDF]

, 2009
The max-edge-coloring problem is a natural weighted generalization of the classical edge-coloring problem arising in the domain of communication systems.
Milis, Ioannis, Bourgeois, N., Milis, I., Lucarelli, Giorgio, Bourgeois, Nicolas, Paschos, V.Th., Paschos, Vangelis, Lucarelli, G.   +7 more
core   +1 more source