The following pages link to Partitions of graphs into cographs (Q607000):
Displaying 13 items.
- Excluding pairs of graphs (Q402589) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- Dynamic \(F\)-free coloring of graphs (Q1637099) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Vertex partitions of graphs into cographs and stars (Q2874091) (← links)
- Partitions of Graphs (Q3064394) (← links)
- Note on strong product graph dimension (Q5888906) (← links)
- Transducing paths in graph classes with unbounded shrubdepth (Q6614398) (← links)
