Results 101 to 110 of about 8,623,913 (295)
Cluster deletion and clique partitioning in graphs with bounded clique number
CoRR14 pages, 3 ...
Nicola Galesi +2 more
openaire +2 more sources
Patterns of psychopathology and personal strengths among youth in psychiatric care
JCPP Advances, EarlyView.Abstract Background The American Academy of Pediatrics and the American Academy of Child and Adolescent Psychiatry have declared a National State of Emergency in Children's Mental Health, calling for improved approaches to address youth mental health.
Logan R. Cummings +78 more
wiley +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
Journal of Graph Theory, EarlyView.ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source
Linear Clique-Width for Hereditary Classes of Cographs [PDF]
, 2016 The class of cographs is known to have unbounded linear clique-width. We prove that a hereditary class of cographs has bounded linear clique-width if and only if it does not contain all quasi-threshold graphs or their complements. The proof borrows ideas
Vincent Vatter +5 more
core +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley +1 more source
The binding number of a graph and its cliques
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeremy Lyle, Wayne Goddard
openaire +3 more sources
Mendeteksi Clique dalam Suatu Graf
, 2013 Given a simple graph G with n vertices. Furthermore, describes an algorithm to get maximum clique in graph G. Every graph G with n vertices and minimum vertex degree δ must have a maximum clique of size at least dn/(n − δ)e.
Apriani, Wiwin
core
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs [PDF]
, 2016 summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spectral radius, signless Laplacian spectral radius) and the clique number together with the corresponding extremal graphs in the class of connected graphs ...
Das, Kinkar Ch., Liu, Muhuo
core +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, EarlyView.ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source