Generalizing cographs to 2-cographs
From MaRDI portal
Recommendations
- Cographs whose complements consist of \(k\)-partite components
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
- Minimal obstructions to 2-polar cographs
- Some spectral properties of cographs
- Vertex partitions of graphs into cographs and stars
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A graph and its complement with specified properties. I: Connectivity
- Complement reducible graphs
- Covering contractible edges in 2-connected graphs
- On Connectivity in Matroids and Graphs
- On a class of posets and the corresponding comparability graphs
- On a property of the class of n-colorable graphs
- On induced subgraphs of a block
- Practical graph isomorphism. II.
- The rank of a cograph
- The strong perfect graph theorem
Cited in
(6)- Forbidden induced subgraph characterization of cograph contractions
- Cographs and 1-sums
- Generalizing Cographs to 2-Cographs
- Cographs whose complements consist of \(k\)-partite components
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
- Apex graphs and cographs
This page was built for publication: Generalizing cographs to 2-cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111769)
