Partitions of graphs into one or two independent sets and cliques
From MaRDI portal
Publication:1917483
Recommendations
- scientific article; zbMATH DE number 3963195
- scientific article; zbMATH DE number 4031746
- Partitioning chordal graphs into independent sets and cliques
- Partitioning chordal graphs into independent sets and cliques
- Independent sets and partitions of graphs
- Partitions of graphs by a method of independent subsets
- Clique and anticlique partitions of graphs
- Partitions of Graphs
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3872703 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- Some simplified NP-complete graph problems
- The splittance of a graph
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(52)- Partitions and well-coveredness: the graph sandwich problem
- Characterizing –partitionable Cographs
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
- Partitioning chordal graphs into independent sets and cliques
- On the probe problem for \((r,\ell )\)-well-coveredness
- Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
- Clique and anticlique partitions of graphs
- Some properties of various graphs associated with finite groups
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
- Groups that have a partition by commuting subsets
- Intersection of chordal graphs and some related partition problems
- The complexity of some problems related to GRAPH 3-COLORABILITY
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs
- Partitioning chordal graphs into independent sets and cliques
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy
- scientific article; zbMATH DE number 1472140 (Why is no real title available?)
- 2-split graphs
- Graph partitions with prescribed patterns
- Recognition of split-graphic sequences
- Packing \(r\)-cliques in weighted chordal graphs
- On equistable, split, CIS, and related classes of graphs
- List matrix partitions of chordal graphs
- The complexity for partitioning graphs by monochromatic trees, cycles and paths
- Partition the vertices of a graph into one independent set and one acyclic set
- \((k,l)\)-colourings and Ferrers diagram representations of cographs
- On the complexity of coloring ‐graphs
- Rainbow graph splitting
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- Hardness and efficiency on minimizing maximum distances in spanning trees
- On decision and optimization (\(k\),\(l\))-graph sandwich problems
- scientific article; zbMATH DE number 3872703 (Why is no real title available?)
- Partitioning graphs into complete and empty graphs
- scientific article; zbMATH DE number 3963195 (Why is no real title available?)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Counting and enumerating independent sets with applications to combinatorial optimization problems
- A note on the recognition of bisplit graphs
- Counting List Matrix Partitions of Graphs
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
- A note on the computational complexity of graph vertex partition
- On the complexity of probe and sandwich problems for generalized threshold graphs
- Clique cycle-transversals in distance-hereditary graphs
- Fixed-parameter algorithms for the cocoloring problem
- On the complexity of scaffolding problems: from cliques to sparse graphs
- On the minimum monochromatic or multicolored subgraph partition problems
- Partitioning cographs into cliques and stable sets
- Group partitions via commutativity
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs
This page was built for publication: Partitions of graphs into one or two independent sets and cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917483)
