Results 181 to 190 of about 8,766 (207)

On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs

2020
The line graph of a graph G denoted as L(G) has vertex set E(G) in which two vertices are adjacent if they correspond to adjacent edges in G. The lict graph and litact graph of G, denoted as \(L_c(G)\) and \(L_{ct}(G)\), respectively having vertex set \(E(G)\cup C(G)\) (here C(G) is the set of cut-vertices of G), two of these vertices will be adjacent ...
Rashmi Jain, Anuj Kumar Jain
openaire   +1 more source

On Generalized Turán Numbers of Intersecting Cliques

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuan, Xiaoli, Peng, Yuejian
openaire   +1 more source

Graphs with large clique-chromatic numbers

Discrete Mathematics, Algorithms and Applications, 2015
The clique-chromatic number of a graph [Formula: see text], [Formula: see text], is the least number of colors on [Formula: see text] without a monocolored maximal clique of size at least two. If [Formula: see text] is triangle-free, [Formula: see text]; we then consider only graphs with a triangle.
Wichianpaisarn, Tanawat, Uiyyasathian, Chariya   +1 more
openaire   +2 more sources

Dense graphs with small clique number

Journal of Graph Theory, 2010
Summary: We consider the structure of \(K_r\)-free graphs with large minimum degree, and show that such graphs with minimum degree \(\delta > (2r - 5)n/(2r - 3)\) are homomorphic to the join \(K_{r - 3} \vee H\), where \(H\) is a triangle-free graph. In particular this allows us to generalize results from triangle-free graphs and show that \(K_r\)-free
Goddard, Wayne, Lyle, Jeremy
openaire   +1 more source

Asymptotic values of clique partition numbers

Combinatorica, 1982
The problem is considered of decomposing a given graph into the minimum number of complete subgraphs. Asymptotic results are obtained for the case where the graph is the complement of a graph with relatively few unisolated vertices.
openaire   +1 more source

Binding Number, Cycles, and Cliques

2018
I discuss the binding number of a graph and Woodall’s conjecture that binding number at least 3∕2 implies a graph is pancyclic.
openaire   +1 more source

Cancer treatment and survivorship statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Kimberly D Miller, Leticia M Nogueira, Angela B Mariotto   +2 more
exaly  

Proportion and number of cancer cases and deaths attributable to potentially modifiable risk factors in the United States

Ca-A Cancer Journal for Clinicians, 2018
Farhad Islami, Ann Goding Sauer Msph, Kimberly D Miller   +2 more
exaly  

Cancer statistics in China, 2015

Ca-A Cancer Journal for Clinicians, 2016
Rongshou Zheng, Peter D Baade, Siwei Zhang   +2 more
exaly  

Cancer treatment and survivorship statistics, 2019

Ca-A Cancer Journal for Clinicians, 2019
Kimberly D Miller, Leticia Nogueira, Angela B Mariotto   +2 more
exaly