The following pages link to List Partitions (Q4443101):
Displaying 37 items.
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← links)
- A note on the recognition of bisplit graphs (Q2501548) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Bisplit graphs (Q2568470) (← links)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
- Matrix partitions of split graphs (Q2636832) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- (Q3089194) (← links)
- (Q3304125) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- Finding<i>H</i>-partitions efficiently (Q4680731) (← links)
- (Q5009627) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Partial complementation of graphs (Q5116485) (← links)
- Excluding a Substar and an Antisubstar (Q5251540) (← links)
- Almost All Friendly Matrices Have Many Obstructions (Q5251620) (← links)
- Partitions (Q5416196) (← links)
- Polar cographs (Q5899394) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)
- Polar cographs (Q5900347) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Generalisations of matrix partitions: complexity and obstructions (Q6564025) (← links)
