Star partitions on graphs

DOI10.1016/j.disopt.2019.01.002zbMath1488.05405OpenAlexW2911226811MaRDI QIDQ2010910

Paolo Serafini, Giovanni Andreatta, Carla 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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Bounds for the Grundy chromatic number of graphs in terms of domination number ⋮ Star covers and star partitions of double-split graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal shift partitioning of pharmacies
• Maximum matchings and trees
• Clustering on trees
• Constrained domatic bipartition on trees
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Towards a theory of domination in graphs
• Parameterized Algorithms

This page was built for publication: Star partitions on graphs