Pages that link to "Item:Q1917483"

The following pages link to Partitions of graphs into one or two independent sets and cliques (Q1917483):

Displaying 41 items.

• Clique cycle-transversals in distance-hereditary graphs (Q299045) (← links)
• Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
• On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
• Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
• Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
• Rainbow graph splitting (Q719272) (← links)
• Counting and enumerating independent sets with applications to combinatorial optimization problems (Q784784) (← links)
• Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
• List matrix partitions of chordal graphs (Q817772) (← links)
• Groups that have a partition by commuting subsets (Q831205) (← links)
• A note on the computational complexity of graph vertex partition (Q868398) (← links)
• The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy (Q903370) (← links)
• Partitioning graphs into complete and empty graphs (Q1045126) (← links)
• The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
• Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
• The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← 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)
• Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
• On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
• Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
• Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367) (← links)
• On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
• Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
• Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
• \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
• Recognition of split-graphic sequences (Q2254547) (← links)
• Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559) (← links)
• Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
• On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
• Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees (Q2479574) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• Partitioning cographs into cliques and stable sets (Q2568333) (← links)
• On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
• On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
• Counting List Matrix Partitions of Graphs (Q2944567) (← links)
• On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
• Characterizing –partitionable Cographs (Q3439349) (← links)
• On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs (Q3467860) (← links)
• Some properties of various graphs associated with finite groups (Q5158969) (← links)
• On the complexity of coloring ‐graphs (Q6092550) (← links)