Results 81 to 90 of about 4,256 (307)

Maximal Colourings for Graphs

open access: yesGraphs and Combinatorics
AbstractWe consider two different notions of graph colouring, namely, the t-periodic colouring for vertices that has been introduced in 1974 by Bondy and Simonovits, and the periodic colouring for oriented edges that has been recently introduced in the context of spectral theory of non-backtracking operators.
openaire   +4 more sources

Graph colouring and variations [PDF]

open access: yes, 1989
Graph Colouring and ...
de Werra, D, Hertz, A
core  

Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271) [PDF]

open access: yes, 2019
This report documents the program and the outcomes of Dagstuhl Seminar 19271 "Graph Colouring: from Structure to Algorithm", which was held from 30 June to 5 July 2019.
Paulusma, Daniel   +2 more
core   +1 more source

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular 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

On k-Distance Pell Numbers in 3-Edge-Coloured Graphs

open access: yesJournal of Applied Mathematics, 2014
We define in this paper new distance generalizations of the Pell numbers and the companion Pell numbers. We give a graph interpretation of these numbers with respect to a special 3-edge colouring of the graph.
Krzysztof Piejko, Iwona Włoch
doaj   +1 more source

Tutorial on defective and clustered graph colouring [PDF]

open access: yes, 2018
Consider the following two ways to colour a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has DEFECT $d$ if each monochromatic component has maximum degree at most $d$.
Wood, David
core  

Finding novel vulnerabilities of hypomorphic BRCA1 alleles

open access: yesMolecular Oncology, EarlyView.
Synthetic lethality screens performed to identify novel vulnerabilities often model complete gene loss, thereby overlooking patient‐derived hypomorphic mutations. In this study, we have performed genome‐wide CRISPR screens on BRCA1 hypomorphic mutations, showing BRCA1I26A behaves like wild‐type, while BRCA1R1699Q mimics deficiency. Furthermore, we have
Anne Schreuder   +10 more
wiley   +1 more source

A novel quinazolinone insulin receptor inhibitor and its synergy with an EGFR inhibitor in glucose‐driven glioblastoma

open access: yesMolecular Oncology, EarlyView.
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka   +9 more
wiley   +1 more source

Graph Colouring with Input Restrictions [PDF]

open access: yes, 2013
In this thesis, we research the computational complexity of the graph colouring problem and its variants including precolouring extension and list colouring for graph classes that can be characterised by forbidding one or more induced subgraphs.
SONG, JIAN
core  

Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma

open access: yesMolecular Oncology, EarlyView.
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski   +10 more
wiley   +1 more source

Home - About - Disclaimer - Privacy