Results 71 to 80 of about 18,582 (315)
On hamiltonian colorings of graphs
Discrete Mathematics, 2005 The authors give a lower bound for the circumference of a graph in terms of the number of vertices that receive colors between two specified colors in a Hamiltonian coloring of the graph. As a consequence, if there exists a Hamiltonian coloring of a connected graph \(G\) of order \(n\) such that at least \((n+2)/2\) vertices of \(G\) are colored with ...
Gary Chartrand +2 more
openaire +2 more sources
Colorful Paths in Vertex Coloring of Graphs [PDF]
The Electronic Journal of Combinatorics, 2011 A colorful path in a graph $G$ is a path with $\chi(G)$ vertices whose colors are different. A $v$-colorful path is such a path, starting from $v$. Let $G\neq C_7$ be a connected graph with maximum degree $\Delta(G)$. We show that there exists a $(\Delta(G)+1)$-coloring of $G$ with a $v$-colorful path for every $v\in V(G)$.
Saieed Akbari +2 more
openaire +2 more sources
On Twin Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2014 A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2023 DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K.
Sribunhung Sarawute +3 more
doaj +1 more source
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
Pewarnaan Titik Ketakteraturan Lokal Inklusif pada Keluarga Graf Unicyclic
Contemporary Mathematics and Applications (ConMathA), 2022 The graph in this paper is a simple and connected graph with V(G) is vertex set and E(G) is edge set. An inklusif local irregularity vertex coloring is defined should be maping l:V(G) í {1,2,..., k} as vertex labeling and wi : V(G) í N is function of ...
Arika Indah Kristiana +2 more
doaj +1 more source
Molecular Oncology, EarlyView.CIN85 is highly expressed in osteosarcoma, particularly in metastatic lesions. Its overexpression increases cell migration and Matrigel invasion, while silencing CIN85 suppresses these behaviors. Transcriptome analysis shows that CIN85 regulates MMP2, COL3A1, and Akt/mTOR signaling. Targeting these pathways reverses CIN85‐induced motility, highlighting
Iryna Horak +10 more
wiley +1 more source
Molecular Oncology, EarlyView.Intratumour heterogeneity complicates precision management of advanced endometrial cancer. Circulating tumor DNA (ctDNA) offers a minimally invasive strategy to capture tumor evolution and therapeutic resistance. Here, we compare tumor‐agnostic NGS with tumor‐informed ddPCR, outlining their relative sensitivity, concordance, and clinical implications ...
Carlos Casas‐Arozamena +15 more
wiley +1 more source
Corrigendum to "Embedding Graphs into Colored Graphs" [PDF]
Transactions of the American Mathematical Society, 1992 The authors give a corrected exposition of the proof of Theorem 12 of their quoted paper [ibid. 307, No. 1, 395-409 (1988; Zbl 0659.03029)].
Hajnal, András, Komjáth, P.
openaire +2 more sources
MATHEMATICA APPLICATION FOR GRAPH COLORING AT THE INTERSECTION OF JALAN PANGERAN ANTASARI JAKARTA
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2017 This research examines about graph coloring using Welch-Powell algorithm. This research begins by trying to understand about graph coloring and its algorithm. The case study was conducted at the intersection of Pangeran Antasari Street.
Suwarno Suwarno
doaj +1 more source