Split-critical and uniquely split-colorable graphs
Ekim, Tinaz; Ries, Bernard; de Werra, Dominique (2010), Split-critical and uniquely split-colorable graphs, Discrete Mathematics and Theoretical Computer Science, 12, 5, p. 1-24
TypeArticle accepté pour publication ou publié
External document linkhttp://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1479/3367
Journal nameDiscrete Mathematics and Theoretical Computer Science
MetadataShow full item record
Abstract (EN)The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as criticality and the uniqueness of the minimum split-coloring. We discuss some properties of split-critical and uniquely split-colorable graphs. We describe constructions of such graphs with some additional properties. We also study the effect of the addition and the removal of some edge sets on the value of the split-chromatic number. All these results are compared with their cochromatic counterparts. We conclude with several research directions on the topic.
Subjects / KeywordsSplit-coloring; split-critical; uniquely split-colorable; split-decreasing
Showing items related by title and author.
Blockers and transversalsnext term in some previous termsubclasses of bipartite graphs: When caterpillars are dancing on a gridnext term Bentz, Cédric; Costa, Marie-Christine; Ries, Bernard; de Werra, Dominique; Picouleau, Christophe; Zenklusen, Rico (2010) Article accepté pour publication ou publié
Bentz, Cédric; Costa, Marie-Christine; Picouleau, Christophe; Ries, Bernard; de Werra, Dominique (2012) Article accepté pour publication ou publié
Ries, Bernard; Picouleau, Christophe; de Werra, Dominique; Costa, Marie-Christine; Bentz, Cédric (2011) Chapitre d'ouvrage