On star partition of split graphs
From MaRDI portal
Publication:6547833
DOI10.1007/978-3-031-52213-0_15MaRDI QIDQ6547833FDOQ6547833
Authors: D. Divya, Sethu Vijayakumar 
Publication date: 31 May 2024
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)
Cites Work
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Optimal packing of induced stars in a graph
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On the completeness of a generalized matching problem
- Clustering to minimize the maximum intercluster distance
- Domination in convex and chordal bipartite graphs
- Set partitioning via inclusion-exclusion
- A simplified NP-complete MAXSAT problem
- A linear algorithm for the domination number of a tree
- The path partition problem and related problems in bipartite graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Title not available (Why is that?)
- Domination in permutation graphs
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
- Title not available (Why is that?)
- Star partitions on graphs
- Induced star partition of graphs
- Star covers and star partitions of double-split graphs
- Star covers and star partitions of cographs and butterfly-free 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)
