A cograph is a graph in which every connected induced subgraph has a disconnected complement. By convention, the graph K1 is taken to be a cograph. Replacing connectedness by 2-connectedness, we define a graph G to be a 2-cograph if G has no induced subgraph H such that both H and its complement, H, are 2-connected.
Feb 28, 2021 · We show that, like cographs, 2-cographs can be recursively defined. But, unlike cographs, 2-cographs are closed under induced minors. We ...
Dec 11, 2022 · We define a 2-cograph to be a graph in which the complement of every 2-connected induced subgraph is not 2-connected. We show that, like ...
Return to Article Details Generalizing Cographs to 2-Cographs Download Download PDF. Thumbnails Document Outline Attachments.
A graph in which every connected induced subgraph has a disconnected complement is called a cograph. Such graphs are precisely the graphs that do not have ...
... A graph G is a 2-cograph if it can be generated from K 1 using the operations of complementation, 0-sum, and 1-sum. The class of 2-cographs has been studied ...
We show that, as with cographs, -cographs can be recursively defined. However, unlike cographs, -cographs are closed under induced minors.
Oct 15, 2023 · In this article, we describe the Laplacian eigenvalues and eigenvectors of a cograph G using its twin reduction graph, and characterize cographs with even and ...
An M-partition of a graph G is an m-colouring of G, in which two special colour classes are completely adjacent (each vertex of one is adjacent to each vertex ...
Generalizing Cographs to 2-Cographs. James Oxley, Jagdeep Singh. P1.1. PDF · Counting Baxter Matrices. George Spahn. P1.2. PDF · Saturation for Small Antichains.