Results 91 to 100 of about 1,967 (126)
, 2005 In this paper, we establish structural properties of cographs which enable us to present an algorithm which, for a cograph G and a non-edge xy (i.e., two non-adjacent vertices x and y) of G, finds the minimum number of edges that need to be added to the edge set of G such that the resulting graph is a cograph and contains the edge xy.
Nikolopoulos, S. D., Palios, L.
openaire +2 more sources
Indirect identification of horizontal gene transfer. [PDF]
J Math Biol, 2021 Schaller D +4 more
europepmc +1 more source
Infinite cographs and chain complete N-free posets
, 2018 We give a necessary and sufficient condition for a $P_4$-free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite $P_4$-free graphs are finite cographs. We also prove that chain complete posets whose comparability graph
Zaguia, Imed
core
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs. [PDF]
J Math Biol, 2021 Schaller D +3 more
europepmc +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
Best match graphs and reconciliation of gene trees with species trees. [PDF]
J Math Biol, 2020 Geiß M +6 more
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