Pages that link to "Item:Q629355"

The following pages link to Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355):

Displaying 6 items.

• 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)
• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
• Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
• Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
• Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)