The following pages link to (Q3424776):
Displayed 20 items.
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Matrix partitions of split graphs (Q2636832) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)