Star covers and star partitions of double-split graphs
From MaRDI portal
Publication:6124494
DOI10.1007/s10878-024-01112-2MaRDI QIDQ6124494
No author found.
Publication date: 27 March 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Mathematical programming (90Cxx)
Cites Work
- Fundamentals of parameterized complexity
- Fast recognition of doubled graphs
- The strong perfect graph theorem
- Domination in convex and chordal bipartite graphs
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- A linear algorithm for the domination number of a tree
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Optimal packing of induced stars in a graph
- Algorithmic graph theory and perfect graphs
- Star partitions on graphs
- Induced star partition of graphs
- The path partition problem and related problems in bipartite graphs
- Forbidden Induced Subgraphs of Double-split Graphs
- Set Partitioning via Inclusion-Exclusion
- Domination in permutation graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Star Partitions of Perfect Graphs
- On the completeness of a generalized matching problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Star covers and star partitions of double-split graphs
