Star partitions on graphs
DOI10.1016/J.DISOPT.2019.01.002zbMATH Open1488.05405OpenAlexW2911226811MaRDI QIDQ2010910FDOQ2010910
C. De Francesco, Paolo Serafini, Giovanni Andreatta, Luigi De Giovanni
Publication date: 28 November 2019
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2019.01.002
Recommendations
Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parameterized Algorithms
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal shift partitioning of pharmacies
- Clustering on trees
- Title not available (Why is that?)
- Maximum matchings and trees
- Constrained domatic bipartition on trees
Cited In (8)
- Bounds for the Grundy chromatic number of graphs in terms of domination number
- Applications of star polynomials to a class of partition problems
- Star factorizations and noncrossing partitions
- Two particles on a star graph. II.
- Star Partitions of Perfect Graphs
- Star covers and star partitions of double-split graphs
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
This page was built for publication: Star partitions on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010910)
