Results 61 to 70 of about 438 (125)
Induced subgraph density. II. Sparse and dense sets in cographs [PDF]
, 2023 Jacob Fox +3 more
openalex +1 more source
CoGraph: Mapping the Structure of the Cognitive Sciences, Neurosciences, & AI
, 2022 Andrew J. Hansen +3 more
openalex +1 more source
Some spectral properties of cographs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammadian, A., Trevisan, V.
openaire +1 more source
A Sharp Threshold Phenomenon in String Graphs. [PDF]
Discrete Comput Geom, 2022 Tomon I.
europepmc +1 more source
Strong tree-cographs are birkhoff graphs
Discrete Applied Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Minimal obstructions for polarity, monopolarity, unipolarity and $(s,1)$-polarity in generalizations of cographs [PDF]
, 2022 Fernando Esteban Contreras-Mendoza +1 more
openalex +1 more source
Best match graphs and reconciliation of gene trees with species trees. [PDF]
J Math Biol, 2020 Geiß M +6 more
europepmc +1 more source
Evolution of neural network to deep learning in prediction of air, water pollution and its Indian context. [PDF]
Int J Environ Sci Technol (Tehran), 2023 Nandi BP, Singh G, Jain A, Tayal DK.
europepmc +1 more source
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Algorithmica, 2022 Jelínek V +4 more
europepmc +1 more source
Reconfiguring Independent Sets in Cographs
, 2014 Two independent sets of a graph are adjacent if they differ on exactly one vertex (i.e. we can transform one into the other by adding or deleting a vertex). Let $k$ be an integer. We consider the reconfiguration graph $TAR_k(G)$ on the set of independent sets of size at least $k$ in a graph $G$, with the above notion of adjacency.
Bonamy, Marthe, Bousquet, Nicolas
openaire +2 more sources