The following pages link to List Partitions (Q4443101):
Displayed 50 items.
- Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Clique versus independent set (Q402465) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← 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 adaptable choosability number grows with the choosability number (Q641204) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Dense and sparse graph partition (Q714027) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- Split digraphs (Q764900) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
- \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Subgraph complementation (Q2182091) (← links)
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms (Q2346339) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- On the density of trigraph homomorphisms (Q2373444) (← links)
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Extended skew partition problem (Q2433705) (← links)