Split-critical and uniquely split-colorable graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Split-critical and uniquely split-colorable graphs


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.
Fichier principal
Vignette du fichier
1479-5705-1-PB.pdf (347.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00990427 , version 1 (13-05-2014)



Tinaz Ekim, Bernard Ries, Dominique de Werra. Split-critical and uniquely split-colorable graphs. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 5 (5), pp.1-24. ⟨10.46298/dmtcs.484⟩. ⟨hal-00990427⟩


61 View
921 Download



Gmail Facebook X LinkedIn More