Pages that link to "Item:Q3544241"

The following pages link to The Complexity of the List Partition Problem for Graphs (Q3544241):

Displaying 18 items.

• Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
• The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
• Obstructions to partitions of chordal graphs (Q383740) (← links)
• Clique versus independent set (Q402465) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
• Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
• Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
• The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
• \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
• The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
• The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
• The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
• Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
• Two algorithms for general list matrix partitions (Q2921752) (← links)
• Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)