Edge Coloring of Split Graphs |
| |
| Affiliation: | 1. Department of Pure and Applied Mathematics, University of Johannesburg, Auckland Park, 2006, South Africa;2. Department of Mathematics, Furman University, Greenville, SC, USA;1. Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil;2. Universidade Federal do Ceará, Fortaleza, Brazil;1. Instituto de Computação, Universidade Estadual de Campinas, Caixa Postal 6176, 13083-971, Campinas - SP, Brazil;2. Independent researcher, Brazil;1. Faculty of Mathematics and Physics, University of Ljubljana, Slovenia;2. Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia;3. Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia;4. Department of Mathematics, Faculty of Science, Arak University, Arak, 38156-8-8349, Iran;5. Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea;1. College of Mathematics and Information Science, Guangxi University, Nanning 530004, Guangxi, PR China;2. Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea |
| |
| Abstract: | A split graph is a graph whose vertex set admits a partition into a stable set and a clique. The chromatic indexes for some subsets of split graphs, such as split graphs with odd maximum degree and split-indifference graphs, are known. However, for the general class, the problem remains unsolved. This paper presents new results about the classification problem for split graphs as a contribution in the direction of solving the entire problem for this class. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
