On star partition of split graphs
From MaRDI portal
Publication:6547833
Cites work
- scientific article; zbMATH DE number 3851152 (Why is no real title available?)
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- A linear algorithm for the domination number of a tree
- A simplified NP-complete MAXSAT problem
- Clustering to minimize the maximum intercluster distance
- Domination in convex and chordal bipartite graphs
- Domination in permutation graphs
- Fundamentals of parameterized complexity
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Induced star partition of graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- On the completeness of a generalized matching problem
- Optimal packing of induced stars in a graph
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
- Set partitioning via inclusion-exclusion
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Star covers and star partitions of cographs and butterfly-free graphs
- Star covers and star partitions of double-split graphs
- Star partitions on graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The path partition problem and related problems in bipartite graphs
Cited in
(2)
This page was built for publication: On star partition of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547833)
