Minimum partition of an independence system into independent sets

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Given an independence system (E, P), the Minimum Partition Problem (MPP) seeks a partition of E into the least number of independent sets. This notion provides a unifying framework for a number of combinatorial optimisation problems, including various conditional colouring problems for graphs. The smallest integer n such that E can be partitioned into n independent sets is called the P-chromatic number of E. In this article we study MPP and the P-chromatic number with emphasis on connections with a few other well-studied optimisation problems. In particular, we show that the P-chromatic number of E is equal to the domination number of a split graph associated with (E, P). With the help of this connection we give a few upper bounds on the P-chromatic number of E in terms of some basic invariants of (E, P). © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Zhou, S. (2009). Minimum partition of an independence system into independent sets. Discrete Optimization, 6(1), 125–133. https://doi.org/10.1016/j.disopt.2008.10.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free