Star partitions on graphs

DOI10.1016/J.DISOPT.2019.01.002zbMATH Open1488.05405OpenAlexW2911226811MaRDI QIDQ2010910FDOQ2010910

Authors Giovanni Andreatta, Paolo Serafini, C. De Francesco, 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

zbMATH Keywords

computational complexitycardinality constraintintegral polytopestar partitiondomatic bipartition

Mathematics Subject Classification ID

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)

Recommendations

• Constrained star partition problems
• Induced star partition of graphs
• The induced star partition of graphs
• Constrained domatic bipartition on trees

Cites work

• scientific article; zbMATH DE number 2086260 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3557519 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3327126 (Why is no real title available?)
• Clustering on trees
• Constrained domatic bipartition on trees
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Maximum matchings and trees
• Optimal shift partitioning of pharmacies
• Parameterized algorithms
• Towards a theory of domination in graphs

Cited in

(12)

• Constrained star partition problems
• Star factorizations and noncrossing partitions
• Two particles on a star graph. II.
• Induced star partition of graphs
• The induced star partition of graphs
• Integer programming models for detecting graph bipartitions with structural requirements
• On star partition of split graphs
• Star covers and star partitions of cographs and butterfly-free graphs
• Applications of star polynomials to a class of partition problems
• The star degree centrality problem: a decomposition approach
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• Star covers and star partitions of double-split 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)