Skip to Main content Skip to Navigation
Journal articles

Split-critical and uniquely split-colorable graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990427
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:36:20 PM
Last modification on : Friday, March 6, 2020 - 8:56:02 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:13:40 PM

File

1479-5705-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990427, version 1

Collections

Citation

Tınaz Ekim, Bernard Ries, Dominique de Werra. Split-critical and uniquely split-colorable graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (5), pp.1-24. ⟨hal-00990427⟩

Share

Metrics

Record views

157

Files downloads

1020