| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652655 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
