Results 51 to 60 of about 438 (125)
Laplacian eigenvalues and eigenspaces of cographs generated by finite sequence [PDF]
, 2023 Santanu Mandal +2 more
openalex +1 more source
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source
Indirect identification of horizontal gene transfer. [PDF]
J Math Biol, 2021 Schaller D +4 more
europepmc +1 more source
Vizing's conjecture for cographs
, 2016 We show that if $G$ is a cograph, that is $P_4$-free, then for any graph $H$, $ (G\square H)\geq (G) (H)$. By the characterization of cographs as a finite sequence of unions and joins of $K_1$, this result easily follows from that of Bartsalkin and German. However, the techniques used are new and may be useful to prove other results.
openaire +2 more sources
From Modular Decomposition Trees to Level-1 Networks: Pseudo-Cographs, Polar-Cats and Prime Polar-Cats [PDF]
, 2021 Marc Hellmuth, Guillaume E. Scholz
openalex +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
, 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
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
(k; l)-Colourings and Ferrers Diagram Representations of Cographs [PDF]
, 2020 Dennis A. Epple, Jing Huang
openalex +1 more source