Pages that link to "Item:Q2433706"

The following pages link to Matrix partitions of perfect graphs (Q2433706):

Displaying 20 items.

• Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
• Obstructions to partitions of chordal graphs (Q383740) (← links)
• 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)
• Partitioning permutations into monotone subsequences (Q820846) (← links)
• Polarity of chordal graphs (Q955313) (← links)
• \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
• The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
• Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
• Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
• On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← 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)