Split-critical and uniquely split-colorable graphs
- Ekim, Tina Bogazici University, Turkey
- Ries, Bernard University of Warwick, United Kingdom
- de Werra, Dominique EPFL, Switzerland
-
2010
Published in:
- Discrete Mathematics and Theoretical Computer Science. - 2010, vol. 12, no. 5, p. 1-24
English
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.
- Faculty
- Faculté des sciences économiques et sociales et du management
- Department
- Département d'informatique
- Language
-
- English
- Classification
- Computer science and technology
- License
- License undefined
- Identifiers
-
- RERO DOC 326880
- DOI 10.46298/dmtcs.484
- Persistent URL
- https://folia.unifr.ch/unifr/documents/308032
Statistics
Document views: 20
File downloads:
- split-critical_0.pdf: 21