Pages that link to "Item:Q2819579"
From MaRDI portal
The following pages link to Complexity of graph partition problems (Q2819579):
Displayed 39 items.
- Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
- Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
- Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Rainbow graph splitting (Q719272) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces (Q1007250) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- Structured proportional representation (Q1686072) (← links)
- Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
- Stable skew partition problem (Q1887035) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- A graph clustering algorithm based on a clustering coefficient for weighted graphs (Q2430549) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- On the sum-max graph partitioning problem (Q2453173) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← links)
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← 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)
- The cd-Coloring of Graphs (Q2795960) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
- 2K2-Partition Problem (Q3439337) (← links)
- Characterizing –partitionable Cographs (Q3439349) (← links)
- NP for Combinatorialists (Q3503495) (← links)
- Factorizations and characterizations of induced‐hereditary and compositive properties (Q4680401) (← links)
- Finding<i>H</i>-partitions efficiently (Q4680731) (← links)
- Communication Complexity of Pairs of Graph Families with Applications (Q5111227) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)