Pages that link to "Item:Q3439349"
From MaRDI portal
The following pages link to Characterizing –partitionable Cographs (Q3439349):
Displaying 9 items.
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- A note on the bichromatic numbers of graphs (Q3061187) (← links)
- A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
