Integrative analysis of FAERS, network toxicology, and Mendelian randomization identifies potential targets in paclitaxel-associated systemic sclerosis. [PDF]
Wang X, Zhang C.
europepmc +1 more source
The recipe similarity network: a new algorithm to extract relevant information from cookbooks. [PDF]
Bellingeri M +5 more
europepmc +1 more source
Methods for Analyzing RNA Pseudoknots via Chord Diagrams and Intersection Graphs. [PDF]
Ibrahim R, Moore AH.
europepmc +1 more source
Benchmarking overlapping community detection methods for applications in human connectomics. [PDF]
Bryant AG +8 more
europepmc +1 more source
Exact and parameterized algorithms for choosability. [PDF]
Bliznets I, Nederlof J.
europepmc +1 more source
Promotion of cooperation in deme-structured populations with growth-merging dynamics
Ribière D, Abbara A, Bitbol A.
europepmc +1 more source
A study on oriented relative clique number
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sandip Das 0001 +2 more
openaire +4 more sources
Related searches:
Independence number and clique minors
Journal of Graph Theory, 2007AbstractThe Hadwiger number ${h}({G})$ of a graph G is the maximum integer t such that ${K}_{t}$ is a minor of G. Since $\chi({G})\cdot\alpha({G})\geq |{G}|$, Hadwiger's conjecture implies that ${h}({G})\cdot \alpha({G})\geq |{G}|$, where $\alpha({G})$ and $|{G}|$ denote the independence number and the number of vertices of G, respectively.
Kawarabayashi, Ken Ichi, Song, Zi Xia
openaire +3 more sources
Extremal Numbers for Disjoint Copies of a Clique
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Clique Numbers of Regular Graphs
Graphs and Combinatorics, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

