Vertex partitions of graphs into cographs and stars
From MaRDI portal
Publication:2874091
Recommendations
Cites work
- scientific article; zbMATH DE number 866055 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Improper choosability of graphs and maximum average degree
- List strong linear 2-arboricity of sparse graphs
- On \(P_4\)-transversals of chordal graphs
- Partitions of graphs into cographs
- The complexity of \(G\)-free colourability
Cited in
(12)- Characterizing –partitionable Cographs
- On the computational complexity of the bipartizing matching problem
- Partitioning cographs into two forests and one independent set
- Excluding pairs of graphs
- Cographs whose complements consist of \(k\)-partite components
- Partitions of graphs into cographs
- Generalizing cographs to 2-cographs
- The adjacency matrix of a graph as a data table: a geometric perspective
- Partitioning a graph into disjoint cliques and a triangle-free graph
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
- Co-2-plex vertex partitions
- On symbolic ultrametrics, cotree representations, and cograph edge decompositions and partitions
This page was built for publication: Vertex partitions of graphs into cographs and stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874091)