Results 91 to 100 of about 4,256 (307)
Combinatorics, Probability and Computing, 2007 We study semirandom k-colourable graphs made up as follows. Partition the vertex set V = {1, . . ., n} randomly into k classes V1, . . ., Vk of equal size and include each Vi–Vj-edge with probability p independently (1 ≤ i < j ≤ k) to obtain a graph G0.
openaire +2 more sources
Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]
We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +2 more
core
Liquid biopsy‐based diagnostic evaluation of hypermethylated CpG sites for ovarian cancer diagnosis
Molecular Oncology, EarlyView.This schematic outlines the workflow from biomarker identification to duplex MethyLight assay validation for epithelial ovarian cancer diagnosis using cfDNA‐based liquid biopsy. Initial screening of hypermethylated CpG candidates (cg02957270, cg10061138 cg00480298, COL2A1) was performed in tissue using ARMS‐PCR, COBRA, qPCR and image analysis. Selected
Deepa Bisht +3 more
wiley +1 more source
New strong colouring of hypergraphs
Le Matematiche, 2011 We define a new colouring for a hypergraph, in particular for a graph. Such a method is a partition of the vertex-set of a hypergraph, in particular of a graph.
Sandro Rajola, Maria Scafati Tallini
doaj
Line game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj +1 more source
Graphs and CombinatoricsAbstract It is proved that for integers b, r such that $$3 \le b < r \le \left( {\begin{array}{c}b+1\\ 2\end{array}}\right) - 1$$ 3 ≤ b < r ≤
Yair Caro +4 more
openaire +2 more sources
Approximate Graph Colouring and Crystals
, 2023 Full version of a SODA 2023 ...
Ciardo, L, Živný, S
openaire +2 more sources
A Measurement-based Algorithm for Graph Colouring [PDF]
, 2021 We present a novel algorithmic approach to find a proper vertex colouring of a graph with d colours, if it exists. We associate a d-dimensional quantum system with each vertex and the initial state is a mixture of all possible colourings, from which we ...
Epping, Michael, Stollenwerk, Tobias
core
Molecular Oncology, EarlyView.BCL9 and BCL9L drive bladder cancer progression by enhancing β‐catenin signaling, promoting proliferation, migration, invasion, and organoid growth. Genetic depletion of BCL9(L) suppresses malignant phenotypes, while pharmacological disruption of the β‐catenin/BCL9(L) complex with ZW4864 inhibits canonical Wnt signaling and tumor‐associated cellular ...
Roland Kotolloshi +11 more
wiley +1 more source
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Forum of Mathematics, Sigma, 2020 A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy, and Szemerédi that applies to almost optimally bounded colourings.
Stefan Ehard, Stefan Glock, Felix Joos
doaj +1 more source